A simpler proof for the two disjoint odd cycles theorem
From MaRDI portal
Publication:744153
DOI10.1016/J.JCTB.2012.11.004zbMATH Open1301.05196OpenAlexW2072305548MaRDI QIDQ744153FDOQ744153
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
Recommendations
- A note on disjoint cycles
- scientific article
- 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
- Decomposition of regular matroids
- Graphs on surfaces
- A Polynomial Solution to the Undirected Two Paths Problem
- Disjoint paths in graphs
- 2-linked graphs
- Title not available (Why is that?)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
Cited In (9)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
- Biased graphs with no two vertex-disjoint unbalanced cycles
- A proof of a dodecahedron conjecture for distance sets
- On Two Unsolved Problems Concerning Matching Covered Graphs
- Title not available (Why is that?)
- Flows on Signed Graphs without Long Barbells
- Title not available (Why is that?)
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
- Relations between global forcing number and maximum anti-forcing number of a graph
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)
