Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Circuit Double Cover of Graphs, PDF eBook

Circuit Double Cover of Graphs PDF

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Other Formats

Information