A simpler proof for the two disjoint odd cycles theorem

DOI10.1016/j.jctb.2012.11.004zbMath1301.05196OpenAlexW2072305548MaRDI QIDQ744153

Kenta Ozeki, Ken-ichi Kawarabayashi

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)

Related Items (8)

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Flows on Signed Graphs without Long Barbells ⋮ Biased graphs with no two vertex-disjoint unbalanced cycles ⋮ Unnamed Item ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ 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

Cites Work

• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Decomposition of regular matroids
• Disjoint paths in graphs
• 2-linked graphs
• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• A Polynomial Solution to the Undirected Two Paths Problem
• Unnamed Item
• Unnamed Item

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