A note about shortest cycle covers (Q2581631)

The authors prove the following result: Let \(G\) be a graph with odd edge-connectivity \(r\). If \(r>3\), then \(G\) has a 3-cycle \((1,2)\)-cover of total length at most \((r+1)| E(G)|/r\).