| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657040 | Journal of Combinatorial Theory, Series B | 2013 | 7 Pages |
Abstract
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
