Short Cycle Covers of Graphs with Minimum Degree Three

The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with $m$ edges can be covered by cycles of total length at most $7m/5=1.400m$. We show that every cubic bridgeless graph has a cycle cover of total length at most $34m/21\approx1.619m$, and every bridgeless graph with minimum degree three has a cycle cover of total length at most $44m/27\approx1.630m$.

[1]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

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

[3]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[4]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[5]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

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

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

[8]  Bill Jackson.  Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow , 1990, SIAM J. Comput..

[9]  Daniel Král,et al.  Unions of perfect matchings in cubic graphs , 2005, Electron. Notes Discret. Math..

[10]  Cun-Quan Zhang.  Circular flows of nearly Eulerian graphs and vertex-splitting , 2002, J. Graph Theory.

[11]  Jean-Sébastien Sereni,et al.  Projective, affine, and abelian colorings of cubic graphs , 2009, Eur. J. Comb..

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

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

[14]  André Raspaud.  Cycle covers of graphs with a nowhere-zero 4-flow , 1991, J. Graph Theory.

[15]  Genghua Fan,et al.  Covering weighted graphs by even subgraphs , 1990, J. Comb. Theory, Ser. B.

[16]  Frank Harary,et al.  Graph Theory , 2016 .

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

[18]  Zoltán Szigeti.  Edge-connectivity augmentation of graphs over symmetric parity families , 2008, Discret. Math..

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

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

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

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

[23]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[24]  Herbert Fleischner,et al.  Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen , 1976 .

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

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

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

[28]  Cun-Quan Zhang,et al.  A note on shortest cycle covers of cubic graphs , 2012, J. Graph Theory.