Book contents
- Frontmatter
- Contents
- Foreword
- Foreword
- Preface
- 1 Circuit double cover
- 2 Faithful circuit cover
- 3 Circuit chain and Petersen minor
- 4 Small oddness
- 5 Spanning minor, Kotzig frames
- 6 Strong circuit double cover
- 7 Spanning trees, supereulerian graphs
- 8 Flows and circuit covers
- 9 Girth, embedding, small cover
- 10 Compatible circuit decompositions
- 11 Other circuit decompositions
- 12 Reductions of weights, coverages
- 13 Orientable cover
- 14 Shortest cycle covers
- 15 Beyond integer (1, 2)-weight
- 16 Petersen chain and Hamilton weights
- Appendix A Preliminary
- Appendix B Snarks, Petersen graph
- Appendix C Integer flow theory
- Appendix D Hints for exercises
- Glossary of terms and symbols
- References
- Author index
- Subject index
Preface
Published online by Cambridge University Press: 05 May 2012
- Frontmatter
- Contents
- Foreword
- Foreword
- Preface
- 1 Circuit double cover
- 2 Faithful circuit cover
- 3 Circuit chain and Petersen minor
- 4 Small oddness
- 5 Spanning minor, Kotzig frames
- 6 Strong circuit double cover
- 7 Spanning trees, supereulerian graphs
- 8 Flows and circuit covers
- 9 Girth, embedding, small cover
- 10 Compatible circuit decompositions
- 11 Other circuit decompositions
- 12 Reductions of weights, coverages
- 13 Orientable cover
- 14 Shortest cycle covers
- 15 Beyond integer (1, 2)-weight
- 16 Petersen chain and Hamilton weights
- Appendix A Preliminary
- Appendix B Snarks, Petersen graph
- Appendix C Integer flow theory
- Appendix D Hints for exercises
- Glossary of terms and symbols
- References
- Author index
- Subject index
Summary
The Circuit (Cycle) Double Cover Conjecture (CDC conjecture) is easy to state: For every 2-connected graph, there is a family ℱ of circuits such that every edge of the graph is covered by precisely two members of ℱ. As an example, if a 2-connected graph is properly embedded on a surface (without crossing edges) in such a way that all faces are bounded by circuits, then the collection of the boundary circuits will “double cover” the graph.
The CDC conjecture (and its numerous variants) is considered by most graph theorists to be one of the major open problems in the field. One reason for this is its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks.
This long standing open problem has been discussed independently in various publications, such as G. Szekeres (1973 [219]), A. Itai and M. Rodeh (1978 [119]), and P. D. Seymour (1979 [205]). According to Professor W. T. Tutte, “the conjecture is one that was well established in mathematical conversation long before anyone thought of publishing it.” Some early investigations related to the conjecture can be traced back to publications by Tutte in the later 1940s.
Some material about circuit covers was presented in the book Integer Flows and Cycle Covers of Graphs (1997 [259]) by the author as an application of flow theory. There are several reasons why the author decided to write a follow-up book mainly on this subject.
- Type
- Chapter
- Information
- Circuit Double Cover of Graphs , pp. xix - xxiiPublisher: Cambridge University PressPrint publication year: 2012