Signed Cycle Double Covers

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together cover every edge of the graph exactly twice. A signed graph is a graph with each edge assigned by a positive or a negative sign. In this article, we prove a weak version of this conjecture that is the existence of a signed cycle double cover for all bridgeless graphs. We also show the relationships of the signed cycle double cover and other famous conjectures such as the Tutte flow conjectures and the shortest cycle cover conjecture etc. Mathematics Subject Classifications: 05C21, 05C22, 05C38

[1]  Alon Itai,et al.  Covering a Graph by Circuits , 1978, ICALP.

[2]  F. Jaeger,et al.  Flows and generalized coloring theorems in graphs , 1979, J. Comb. Theory, Ser. B.

[3]  André Raspaud,et al.  Fulkerson's Conjecture and Circuit Covers , 1994, J. Comb. Theory, Ser. B.

[4]  Robert Sámal,et al.  Short Cycle Covers of Graphs with Minimum Degree Three , 2009, SIAM J. Discret. Math..

[5]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[6]  N. Alon,et al.  Covering Multigraphs by Simple Circuits , 1985 .

[7]  W. T. Tutte.  On the algebraic theory of graph colorings , 1966 .

[8]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[9]  P. D. Seymour,et al.  On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte , 1979 .

[10]  Myriam Preissmann.  Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges) , 1981 .

[11]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[12]  André Raspaud,et al.  Short cycle covers of graphs and nowhere-zero flows , 2011, J. Graph Theory.

[13]  Michael Tarsi,et al.  Short cycle covers and the cycle double cover conjecture , 1992, J. Comb. Theory, Ser. B.

[14]  Daniel Král,et al.  Short Cycle Covers of Cubic Graphs , .

[15]  Bill Jackson,et al.  Shortest coverings of graphs with cycles , 1983, J. Comb. Theory, Ser. B.

[16]  André Raspaud,et al.  Short circuit covers for regular matroids with a nowhere zero 5-flow , 1987, J. Comb. Theory, Ser. B.

[17]  G. Szekeres,et al.  Polyhedral decompositions of cubic graphs , 1973, Bulletin of the Australian Mathematical Society.

[18]  Edita Mácajová,et al.  Fano colourings of cubic graphs and the Fulkerson Conjecture , 2005, Theor. Comput. Sci..

[19]  Paul D. Seymour,et al.  Nowhere-zero 6-flows , 1981, J. Comb. Theory, Ser. B.

[20]  Cun-Quan Zhang.  Circuit Double Covers of Graphs , 2012 .

[21]  Cun-Quan Zhang.  Integer Flows and Cycle Covers of Graphs , 1997 .

[22]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[23]  Bill Jackson.  Shortest Circuit Covers of Cubic Graphs , 1994, J. Comb. Theory, Ser. B.

[24]  Genghua Fan.  Short cycle covers of cubic graphs , 1994, J. Graph Theory.