✦ LIBER ✦

Alternating paths in edge-colored complete graphs

✍ Scribed by Y. Manoussakis

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 897 KB
Volume: 56
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00091-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Monochromatic paths in edge-colored grap

Monochromatic paths in edge-colored graphs

✍ V Chvátal 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 64 KB

Alternating cycles in edge-colored graph

Alternating cycles in edge-colored graphs

✍ Carol Whitehead 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

We show that the edges of a 2-connected graph can be partitioned into two color classes so that every vertex is incident with edges of each color and every alternating cycle passes through a single edge. We also show that the edges of a simple graph with minimum vertex degree 6 2 2 can be partitione

2-Colored triangles in edge-colored comp

2-Colored triangles in edge-colored complete graphs

✍ D.T Busolini 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 82 KB

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