| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656947 | Journal of Combinatorial Theory, Series B | 2013 | 20 Pages |
Abstract
Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5K5. In this paper, we prove the conjecture for graphs containing K4−.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jie Ma, Xingxing Yu,