𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Alternating cycles in edge-partitioned graphs

✍ Scribed by Jerrold W Grossman; Roland Häggkvist

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
267 KB
Volume
34
Category
Article
ISSN
0095-8956

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.

A Note on Alternating Cycles in Edge-Col
A Note on Alternating Cycles in Edge-Coloured Graphs
✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

Monochromatic cycle partitions of edge-c
Monochromatic cycle partitions of edge-colored graphs
✍ Gábor N. Sárközy 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB 👁 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, Gyárfás and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver