Abstract: In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n−1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g * ≥ 3 and k(G) components, there is a family of at most −n+k(G) cocycles which cover the edges of G at least twice
