𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle structure of edge labelled graphs

✍ Scribed by James S. Diamond; Alberto O. Mendelzon

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
795 KB
Volume
45
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge disjoint cycles in graphs
Edge disjoint cycles in graphs
✍ Li Hao πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 419 KB
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

Edge disjoint Hamilton cycles in graphs
Edge disjoint Hamilton cycles in graphs
✍ Guojun Li πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views
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