A simpler proof for the two disjoint odd cycles theorem
A simpler proof for the two disjoint odd cycles theorem
复制标题
DOI：
10.1016/j.jctb.2012.11.004
复制
发表时间：
2013-05
期刊：
影响因子：
--
通讯作者：
K. Kawarabayashi;K. Ozeki
中科院分区：
文献类型：
--
作者：
K. Kawarabayashi;K. Ozeki
We give a short proof of the two disjoint odd cycles theorem which characterizes graphs without two vertex-disjoint odd cycles. Our proof does not depend on any matroid result. It only uses the two paths theorem, which characterizes graphs without two disjoint paths with specified ends (i.e., 2-linked graphs).
