Shortest Circuit Covers of Cubic Graphs

We show that the edge set of a bridgeless cubic graph G can be covered with circuits such that the sum of the lengths of the circuits is at most 6439|E(G)|. Stronger results are obtained for cubic graphs of large girth.