Covering Graphs by Cycles

DOI10.1137/0405039MaRDI QIDQ4030187zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cycle coverEulerian subgraphpolynomial time algorithm

Mathematics Subject Classification ID

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

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

Cited in

(40)

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

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)