✦ LIBER ✦

Double cycle covers and the petersen graph

✍ Scribed by Paul A. Catlin

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 711 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130408

No coin nor oath required. For personal study only.

✦ Synopsis

Let O(G) denote the set of odd-degree vertices of a graph G. Let t E N and let 9, denote the family of graphs G whose edge set has a partition

This partition is associated with a double cycle cover of G. We show that if a graph G is at most 5 edges short of being 4-edge-connected, then exactly one of these holds: G E 9,. G has at least one cut-edge, or G is contractible to the Petersen graph.

We also improve a sufficient condition of Jaeger for G E Y Z p + , ( p E N).

📜 SIMILAR VOLUMES

On cycle double covers of line graphs

✍ Leizhen Cai; Derek Corneil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

It is shown that if a graph has a cycle double cover, then its line graph also has a cycle double cover. The converse of this result for 2-edge-connected graphs would imply the truth of the cycle double cover conjecture. Cycle Double Cover Conjecture (CDCC). Every 2-edge-connected graph has a CDC.

Five Cycle Double Covers of Some Cubic G

Five Cycle Double Covers of Some Cubic Graphs

✍ A. Huck; M. Kochol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Supereulerian Graphs and the Petersen Gr

Supereulerian Graphs and the Petersen Graph

✍ Paul A. Catlin; Hong-Jian Lai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph.

Nowhere-zero 4-flows and cycle double co

Nowhere-zero 4-flows and cycle double covers

✍ Cun-Quan Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 572 KB

In this paper, we obtained some necessary and sufficient conditions for a graph having 5, 6and 7-cycle double covers, etc. We also provide a few necessary and sufficient conditions for a graph admitting a nowhere-zero 4-flow. With the aid of those basic properties of nowhere-zero 4flow and the resul

Cycle and cocycle coverings of graphs

✍ Sean McGuinness 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n-1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g \* ≥ 3 and

Nonplanar graphs and well-covered cycles

✍ R. Bruce Richter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In his talk 'Spanning tees of planar maps' at the 19th Southeastern Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, February 1988), Rosenfeld stated the following conjecture. Conjecture. Let G be a 2-connected graph and let % be a collection of cycles in G such that: (i)