A note about shortest cycle covers

Let G be a graph with odd edge-connectivity r. It is proved in this paper that if image, then G has a 3-cycle image-cover of total length at most image.