Cycle double covers and spanning minors II
✍ Scribed by Roland Häggkvist; Klas Markström
- Book ID
- 108113585
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 238 KB
- Volume
- 306
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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