𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Short cycle covers and the cycle double cover conjecture

✍ Scribed by Ury Jamshy; Michael Tarsi

Book ID
107884327
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
578 KB
Volume
56
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tutteβ€²s 3-Flow Conjecture and Short Cycl
Tutteβ€²s 3-Flow Conjecture and Short Cycle Covers
✍ G.H. Fan πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 285 KB

In this paper we prove: (i) If a graph \(G\) has a nowhere-zero 6 -llow \(\phi\) such that \(\left|E_{\text {odd }}(\phi)\right| \geqslant \frac{2}{3}|E(G)|\), then \(G\) has a cycle cover in which the sum of the lengths of the cycles in the cycle cover is at most \(\frac{44}{27}|E(G)|\), where \(E_

HajΓ³s' conjecture and small cycle double
HajΓ³s' conjecture and small cycle double covers of planar graphs
✍ Karen Seyffarth πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 865 KB

## Seyffarth, K., Hajos' conjecture and small cycle double covers of planar graphs, Discrete Mathematics 101 (1992) 291-306. We prove that every simple even planar graph on n vertices has a partition of its edge set into at most [(n -1)/2] cycles. A previous proof of this result was given by Tao,

Double cycle covers and the petersen gra
Double cycle covers and the petersen graph
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 711 KB

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