Covering Graphs by Cycles

DOI10.1137/0405039zbMATH Open0777.05087OpenAlexW2092866491MaRDI QIDQ4030187FDOQ4030187

Authors: Genghua 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

Recommendations

• Cycle covering in bridgeless graphs
• Short cycle covers of graphs with minimum degree three
• Covering odd cycles
• Covering Multigraphs by Simple Circuits
• Cycle and cocycle coverings of graphs

zbMATH Keywords

polynomial time algorithmcycle coverEulerian subgraph

Mathematics Subject Classification ID

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

Cited In (39)

• Covering the complete graph with plane cycles
• Covering and tiling hypergraphs with tight cycles
• Title not available (Why is that?)
• Circuit double covers of graphs
• Covering the vertices of a graph with cycles of bounded length
• Cycle covering in bridgeless graphs
• A note on Berge-Fulkerson coloring
• Covering and Euler cycles on non-oriented graphs
• Title not available (Why is that?)
• Covering Multigraphs by Simple Circuits
• Cycles in Graphs and Covers
• Covering step graph
• Short cycle covers of cubic graphs
• A bound on the total size of a cut cover
• Title not available (Why is that?)
• Low congestion cycle covers and their applications
• Extensions of flow theorems
• Covering a graph with cycles.
• Some properties of the fleet assignment problem
• Berge–Fulkerson coloring for C(12)‐linked permutation graphs
• Covering a graph with cycles
• Cycle double covers of infinite planar graphs
• Berge-Fulkerson coloring for some families of superposition snarks
• Exploration of \(k\)-edge-deficient temporal graphs
• Covering weighted graphs by even subgraphs
• Approximately covering by cycles in planar graphs.
• Covering cycle matroid
• Shortest coverings of graphs with cycles
• The covering chain of a graph
• Exploration of \(k\)-edge-deficient temporal graphs
• Shipper collaboration
• Finding vertex-disjoint cycle cover of undirected graph using the least-squares method.
• Covering a graph with cycles passing through given edges
• Computational complexity of covering cyclic graphs
• Circuit decompositions and shortest circuit coverings of hypergraphs
• Proofs of two minimum circuit cover conjectures
• Cycle and cocycle coverings of graphs
• On shortest cocycle covers of graphs
• Covering vertices of a graph by \(k\) disjoint cycles

This page was built for publication: Covering Graphs by Cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030187)