Circuit Double Cover of Graphs
£51.99
Part of London Mathematical Society Lecture Note Series
- Author: Cun-Quan Zhang, West Virginia University
- Date Published: April 2012
- availability: Available
- format: Paperback
- isbn: 9780521282352
£
51.99
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix.
Read more- Terminology is listed in an appendix for those new to the field
- Includes A Mini Encyclopedia of the Petersen Graph
- Provides hints for selected exercises
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: April 2012
- format: Paperback
- isbn: 9780521282352
- length: 375 pages
- dimensions: 226 x 152 x 20 mm
- weight: 0.56kg
- contains: 120 b/w illus. 200 exercises
- availability: Available
Table of Contents
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.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×