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

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)

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

(39)

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