Short cycle covers on cubic graphs using chosen 2-factor

Barbora Candráková, Robert Lukoťka

We show that every bridgeless cubic graph $G$ with $m$ edges has a cycle cover of length at most $1.6m$. Moreover, if $G$ does not contain any intersecting circuits of length $5$,…