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.
Publisher: Cambridge University Press
Number of pages: 375
Weight: 540 g
Dimensions: 226 x 152 x 20 mm
"This book draws a comprehensive panoramic image of material from a large number of results spread through various papers.The most essential of these results are virtually rewritten, and the fabric of connections among them is revealed. The author establishes a uniform framework in which most of the work done so far, as well as potential directions for future work, is described and can be understood in a clear and systematic manner. The book is recommended to researchers and students interested in graph theory."
Martin Kochol, Mathematical Reviews