𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-colored complete graphs with precisely colored subgraphs

✍ Scribed by F. R. K. Chung; R. L. Graham

Book ID
110564237
Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
431 KB
Volume
3
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Properly colored hamilton cycles in edge
Properly colored hamilton cycles in edge-colored complete graphs
✍ N. Alon; G. Gutin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 156 KB πŸ‘ 3 views

It is shown that, for β‘€ ) 0 and n ) n β‘€ , any complete graph K on n vertices 0 ' Ε½ . whose edges are colored so that no vertex is incident with more than 1 y 1r 2 y β‘€ n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and

Edge-colored complete graphs with altern
Edge-colored complete graphs with alternating cycles
✍ S.H. Whitesides πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 648 KB

We prove that if the edges of the complete graph on n ~4 vertices are colored so that no vertex is on more than A edges of the same color, 1 c A < n -2,, then the graph has cycles of all lengths 3 through n with no A consecutive edges the same color.

Characterization of edge-colored complet
Characterization of edge-colored complete graphs with properly colored Hamilton paths
✍ Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Gutin; Tommy Jensen; Arash Ra πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract An edge‐colored graph __H__ is properly colored if no two adjacent edges of __H__ have the same color. In 1997, J. Bang‐Jensen and G. Gutin conjectured that an edge‐colored complete graph __G__ has a properly colored Hamilton path if and only if __G__ has a spanning subgraph consisting