Journal of Combinatorial Theory, Series BVolume 35, Issue 3, December 1983, Pages 297-308Shortest coverings of graphs with cyclesAuthor links open overlay panelJean Claude Bermond, Bill Jackson, François JaegerShow moreShareCitehttps://doi.org/10.1016/0095-8956(83)90056-4Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIt is shown that the edges of a bridgeless graph G can be covered with cycles such that the sum of the lengths of the cycle is at most |E(G) + min {23|E(G)|, 73(|V(G)| − 1)}.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1983 Published by Elsevier Inc.