Circuit extension and circuit double cover of graphs

Abstract Let G be a cubic graph and C be a circuit. An extension of C is a circuit D such that V ( C ) ⊆ V ( D ) and E ( C ) ≠ E ( D ) . The study of circuit extension is motivated by the circuit double cover conjecture. It is proved by Fleischner (1990) that a circuit C is extendable if C has only one non-trivial Tutte bridge. It is further improved by Chan, Chudnovsky and Seymour (2009) that a circuit is extendable if it has only one odd Tutte bridge. Those earlier results are improved in this paper that C is extendable if all odd Tutte bridges of C are sequentially lined up along C . It was proved that if every circuit is extendable for every bridgeless cubic graph, then the circuit double cover conjecture is true (Kahn, Robertson, Seymour 1987). Although graphs with stable circuits have been discovered by Fleischner (1994) and Kochol (2001), variations of this approach remain one of most promising approaches to the circuit double cover conjecture. Following some early investigation of Seymour and Fleischner, we further study the relation between circuit extension and circuit double cover conjecture, and propose a new approach to the conjecture. This new approach is verified for some graphs with stable circuits constructed by Fleischner and Kochol.

[1]  Andreas Huck On cycle-double covers of graphs of small oddness , 2001, Discret. Math..

[2]  Herbert Fleischner Proof of the strong 2-Cover Conjecture for planar graphs , 1986, J. Comb. Theory, Ser. B.

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

[4]  Roland Häggkvist,et al.  Double covers of cubic graphs with oddness 4 , 2005, J. Comb. Theory, Ser. B.

[5]  Brian Alspach Circuit Double Cover of Graphs: Foreword , 2012 .

[6]  C. Godsil,et al.  Cycles in graphs , 1985 .

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

[8]  Peter Adams,et al.  3,5‐Cycle decompositions , 1998 .

[9]  Melody Chan A survey of the cycle double cover conjecture , 2009 .

[10]  Klas Markström,et al.  Cycle double covers and spanning minors I , 2006, J. Comb. Theory, Ser. B.

[11]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[12]  Martin Kochol Stable dominating circuits in snarks , 2001, Discret. Math..

[13]  Tommy R. Jensen,et al.  A note on semiextensions of stable circuits , 2009, Discret. Math..

[14]  Brian Alspach,et al.  Graphs with the circuit cover property , 1994 .

[15]  Cun-Quan Zhang,et al.  Cycle covers of cubic multigraphs , 1993, Discret. Math..

[16]  Tommy R. Jensen,et al.  On semiextensions and circuit double covers , 2007, J. Comb. Theory, Ser. B.

[17]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[18]  Klas Markström,et al.  Cycle double covers and spanning minors II , 2006, Discret. Math..

[19]  Herbert Fleischner Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs , 1994, J. Graph Theory.

[20]  J D HANCOCK,et al.  Unsolved problems , 1987 .

[21]  Martin Kochol,et al.  Five Cycle Double Covers of Some Cubic Graphs , 1995, J. Comb. Theory, Ser. B.

[22]  Roland Häggkvist,et al.  Circuit double covers in special types of cubic graphs , 2009, Discret. Math..

[23]  V. Rich Personal communication , 1989, Nature.

[24]  Michael Tarsi,et al.  Semi-duality and the cycle double cover conjecture , 1986, J. Comb. Theory, Ser. B.

[25]  A. Thomason Hamiltonian Cycles and Uniquely Edge Colourable Graphs , 1978 .

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

[27]  Cun-Quan Zhang,et al.  Cycle double covers and the semi-Kotzig frame , 2011, Eur. J. Comb..