A simpler proof for the two disjoint odd cycles theorem

DOI10.1016/J.JCTB.2012.11.004MaRDI QIDQ744153zbMATHOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Kenta Ozeki

Publication date 6 October 2014

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

Full work available at URL https://doi.org/10.1016/j.jctb.2012.11.004

zbMATH Keywords

2-linked graphsgraphs without two vertex-disjoint odd cyclestwo paths theorem

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• A note on disjoint cycles
• scientific article; zbMATH DE number 3863236
• Proof of a conjecture on cycles in a bipartite graph
• The confirmation of a conjecture on disjoint cycles in a graph
• scientific article; zbMATH DE number 219251
• ON DISJOINT CYCLES
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
• A new proof of a theorem on long cycles
• A short proof of the odd-girth theorem
• A conjecture of Verstraëte on vertex-disjoint cycles

Cites work

• scientific article; zbMATH DE number 863479 (Why is no real title available?)
• 2-linked graphs
• A Polynomial Solution to the Undirected Two Paths Problem
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Decomposition of regular matroids
• Disjoint paths in graphs
• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• Graphs on surfaces

Cited in

(9)

• Flows on signed graphs without long barbells
• Relations between global forcing number and maximum anti-forcing number of a graph
• Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
• Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
• scientific article; zbMATH DE number 7561516 (Why is no real title available?)
• scientific article; zbMATH DE number 3863236 (Why is no real title available?)
• A proof of a dodecahedron conjecture for distance sets
• Biased graphs with no two vertex-disjoint unbalanced cycles
• On two unsolved problems concerning matching covered graphs

This page was built for publication: A simpler proof for the two disjoint odd cycles theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744153)