A note about shortest cycle covers
From MaRDI portal
Publication:2581631
DOI10.1016/j.disc.2005.06.013zbMath1097.05023OpenAlexW2129350639MaRDI QIDQ2581631
Publication date: 10 January 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.013
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tutte's 3-flow conjecture and short cycle covers
- Shortest coverings of graphs with cycles
- Cycle covering in bridgeless graphs
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Flows and generalized coloring theorems in graphs
- Integer flows and cycle covers
- Short cycle covers and the cycle double cover conjecture
- Fulkerson's conjecture and circuit covers
- Proofs of two minimum circuit cover conjectures
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Minimum cycle coverings and integer flows
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Covering Multigraphs by Simple Circuits
- Cycle covers of graphs with a nowhere-zero 4-flow
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Smallest (1, 2)‐eulerian weight and shortest cycle covering
- Graphs with the Circuit Cover Property
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- Maximum matching and a polyhedron with 0,1-vertices
- Polyhedral decompositions of cubic graphs
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: A note about shortest cycle covers
