| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903887 | Journal of Combinatorial Theory, Series B | 2018 | 46 Pages |
Abstract
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan,