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
7 - Spanning trees, supereulerian graphs
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

- Type
- Chapter
- Information
- Circuit Double Cover of Graphs , pp. 83 - 95Publisher: Cambridge University PressPrint publication year: 2012