Short cycle covers and the cycle double cover conjecture

DOI10.1016/0095-8956(92)90018-SzbMath0776.05066MaRDI QIDQ1204464

Michael Tarsi, Ury Jamshy

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

cycle double cover conjectureregular matroid

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (24)

Semi-duality and the cycle double cover conjecture ⋮ Shortest circuit covers of signed graphs ⋮ A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ Characteristic flows on signed graphs and short circuit covers ⋮ A note on shortest cycle covers of cubic graphs ⋮ Circuit Covers of Signed Graphs ⋮ On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Short signed circuit covers of signed graphs ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ Some snarks are worse than others ⋮ Short cycle covers of graphs with at most 77\% vertices of degree two ⋮ Signed circuit cover of bridgeless signed graphs ⋮ Signed cycle double covers ⋮ Integer 4-flows and cycle covers ⋮ Cubic Graphs with No Short Cycle Covers ⋮ A bound on the total size of a cut cover ⋮ Graphs with the Circuit Cover Property ⋮ Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width ⋮ Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits ⋮ Circuit Covers of Signed Eulerian Graphs ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor ⋮ A note on Berge-Fulkerson coloring ⋮ A note about shortest cycle covers

Cites Work

• Unnamed Item
• Tutte's 3-flow conjecture and short cycle covers
• Shortest coverings of graphs with cycles
• Nowhere zero flow and circuit covering in regular matroids
• On shortest cocycle covers of graphs
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Decomposition of regular matroids
• Covering Multigraphs by Simple Circuits
• Covering Graphs by Simple Circuits
• Modular Constructions for Combinatorial Geometries

This page was built for publication: Short cycle covers and the cycle double cover conjecture