Skip to Main content Skip to Navigation
Journal articles

Shortest coverings of graphs with cycles

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)}.
Complete list of metadata

https://hal.inria.fr/hal-02447197
Contributor : Jean-Claude Bermond <>
Submitted on : Tuesday, January 21, 2020 - 2:34:43 PM
Last modification on : Saturday, May 1, 2021 - 3:39:21 AM

File

58-BJJ83-coveringcycles.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Claude Bermond, Bill Jackson, François Jaeger. Shortest coverings of graphs with cycles. Journal of Combinatorial Theory, Series B, Elsevier, 1983, 35 (3), pp.297-308. ⟨10.1016/0095-8956(83)90056-4⟩. ⟨hal-02447197⟩

Share

Metrics

Record views

69

Files downloads

516