A simpler proof for the two disjoint odd cycles theorem
type: Item
instance of: scholarly article
title: A simpler proof for the two disjoint odd cycles theorem
zbMATH Open document ID: 1301.05196
author: Ken-ichi Kawarabayashi
author: Kenta Ozeki
published in: Journal of Combinatorial Theory. Series B
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6351527
zbMATH Keywords: graphs without two vertex-disjoint odd cycles
zbMATH Keywords: two paths theorem
zbMATH Keywords: 2-linked graphs
MaRDI profile type: Publication
full work available at URL: j.jctb.2012.11.004
OpenAlex ID: W2072305548
cites work: A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
cites work: Graphs on surfaces
cites work: Decomposition of regular matroids
cites work: Disjoint paths in graphs
cites work: Q4871758
cites work: A Polynomial Solution to the Undirected Two Paths Problem
cites work: 2-linked graphs
cites work: Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
DOI: 10.1016/J.JCTB.2012.11.004
Recommended article: A note on disjoint cycles
Recommended article: Q3331247
Recommended article: Proof of a conjecture on cycles in a bipartite graph
Recommended article: The confirmation of a conjecture on disjoint cycles in a graph
Recommended article: Q4694737
Recommended article: ON DISJOINT CYCLES
Recommended article: Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
Recommended article: A New Proof of a Theorem on Long Cycles
Recommended article: A short proof of the odd-girth theorem
Recommended article: A Conjecture of Verstraëte on Vertex-Disjoint Cycles
description: scientific article; zbMATH DE number 6351527