Shortest coverings of graphs with cycles

https://doi.org/10.1016/0095-8956(83)90056-4Get rights and content
Under an Elsevier user license
open archive

Abstract

It 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)}.

Cited by (0)