Covering Graphs by Cycles

DOI10.1137/0405039zbMath0777.05087OpenAlexW2092866491MaRDI QIDQ4030187

Geng-Hua Fan

Publication date: 1 April 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405039

zbMATH Keywords

polynomial time algorithmEulerian subgraphcycle cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Some properties of the fleet assignment problem ⋮ Extensions of flow theorems ⋮ Short cycle covers of cubic graphs ⋮ Shipper collaboration ⋮ Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Covering a graph with cycles. ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ A bound on the total size of a cut cover ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Cycle double covers of infinite planar graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Proofs of two minimum circuit cover conjectures ⋮ A note on Berge-Fulkerson coloring ⋮ Circuit Double Covers of Graphs

This page was built for publication: Covering Graphs by Cycles