A counterexample to the bipartizing matching conjecture

DOI10.1016/j.disc.2007.01.019zbMath1127.05078OpenAlexW1998453860WikidataQ123267461 ScholiaQ123267461MaRDI QIDQ2461200

Arthur Hoffmann-Ostenhof

Publication date: 27 November 2007

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

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

zbMATH Keywords

cycle double coversnarkcircle graphnowhere zero 5-flowbipartizing matching

Mathematics Subject Classification ID

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

Cites Work

• Eulerian colorings and the bipartizing matchings conjecture of Fleischner
• Bipartizing matchings and Sabidussi's compatibility conjecture
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
• Unnamed Item
• Unnamed Item

This page was built for publication: A counterexample to the bipartizing matching conjecture