Short cycle covers of cubic graphs
Genghua Fan · Journal of Graph Theory · 1994
Abstract Let G be a bridgeless cubic graph. We prove that the edges of G can be covered by circuits whose total length is at most (44/27) | E(G) |, and if Tutte's 3‐flow Conjecture is true, at most (92/57) | E(G) |.