Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-28T01:41:16.683Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  05 May 2012

Cun-Quan Zhang
Affiliation:
West Virginia University
Get access

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
Publisher: Cambridge University Press
Print publication year: 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
  • Cun-Quan Zhang, West Virginia University
  • Book: Circuit Double Cover of Graphs
  • Online publication: 05 May 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511863158.003
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
  • Cun-Quan Zhang, West Virginia University
  • Book: Circuit Double Cover of Graphs
  • Online publication: 05 May 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511863158.003
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
  • Cun-Quan Zhang, West Virginia University
  • Book: Circuit Double Cover of Graphs
  • Online publication: 05 May 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511863158.003
Available formats
×