𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Color degree and alternating cycles in edge-colored graphs

✍ Scribed by Guanghui Wang; Hao Li

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
495 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

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

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