Small Circuit Double Covers of Cubic Multigraphs

Let G be a two-connected graph. A family F of circuits of G is called a circuit double cover (CDC) if each edge of G is contained in exactly two circuits of F. In this paper, we show that if a simple cubic graph G (G ? K4) of order n has a CDC, then G has a CDC containing at most n/2 circuits. This result establishes the equivalence of the circuit double cover conjecture (due to Szekeres, Seymour) and the small circuit double cover conjecture (due to Bondy) for any cubic graph. Actually, a stronger result is obtained in this paper for all loopless cubic graphs. Another result in this paper establishes an upper bound on the size of any CDC of a cubic graph.

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

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

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

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

[5]  Hao Li.  Perfect path double covers in every simple graph , 1990, J. Graph Theory.

[6]  Luis Goddyn.  A Girth Requirement for the Double Cycle Cover Conjecture , 1985 .

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

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

[9]  Genghua Fan.  Integer flows and cycle covers , 1992, J. Comb. Theory, Ser. B.