✦ LIBER ✦

On Edge-Colored Graphs Covered by Properly Colored Cycles

✍ Scribed by Herbert Fleischner; Stefan Szeider

Publisher: Springer Japan
Year: 2005
Tongue: English
Weight: 110 KB
Volume: 21
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0613-4

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

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

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

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.

The heterochromatic cycles in edge-color

The heterochromatic cycles in edge-colored graphs

✍ Dongxiao Yu; Guizhen Liu; Shuo Li 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 291 KB

Cycles and paths in edge-colored graphs

Cycles and paths in edge-colored graphs with given degrees

✍ A. Abouelaoualim,; K. Ch. Das; W. Fernandez de la Vega; M. Karpinski; Y. Manouss 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

## Abstract Sufficient degree conditions for the existence of properly edge‐colored cycles and paths in edge‐colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edge‐colored multigraph of order __n__ on at least three colors and with minimum colored degre