Proofs of two minimum circuit cover conjectures
From MaRDI portal
Publication:1569041
DOI10.1006/jctb.1998.1854zbMath1024.05074OpenAlexW1968574902MaRDI QIDQ1569041
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1854
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Shortest circuit covers of signed graphs ⋮ An overview of graph covering and partitioning ⋮ Circuit Covers of Signed Graphs ⋮ Short signed circuit covers of signed graphs ⋮ Signed circuit cover of bridgeless signed graphs ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ A bound on the total size of a cut cover ⋮ A note about shortest cycle covers
Cites Work
- Unnamed Item
- Unnamed Item
- Shortest coverings of graphs with cycles
- Cycle covering in bridgeless graphs
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Extensions of flow theorems
- A Class Of Abelian Groups
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Covering Multigraphs by Simple Circuits
- Covering Graphs by Simple Circuits
- Covering Graphs by Cycles
- Graphs with the Circuit Cover Property
- Matching, Euler tours and the Chinese postman
This page was built for publication: Proofs of two minimum circuit cover conjectures