A bound on the total size of a cut cover

DOI10.1016/J.DISC.2005.04.003zbMath1066.05111OpenAlexW1980860919MaRDI QIDQ2484376

André Kündgen, Megan Spangler

Publication date: 1 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.003

zbMATH Keywords

CycleEdge cover

Mathematics Subject Classification ID

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

Related Items (3)

An overview of graph covering and partitioning ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Cycle covering in bridgeless graphs
• On shortest cocycle covers of graphs
• Proof of a conjecture of Katona and Tarjan
• Short cycle covers and the cycle double cover conjecture
• Proofs of two minimum circuit cover conjectures
• On embedding complete graphs into hypercubes
• Covering Multigraphs by Simple Circuits
• On a problem of G. O. H. Katona and T. Tarján
• Covering Graphs by Simple Circuits
• On the Decomposition of Graphs
• Covering Graphs by Cycles
• Graphs with the Circuit Cover Property
• On the Complexity of Finding a Minimum Cycle Cover of a Graph
• The Representation of a Graph by Set Intersections
• Polyhedral decompositions of cubic graphs
• Covering a graph with cuts of minimum total size

This page was built for publication: A bound on the total size of a cut cover