K-6 minors in large 6-connected graphs
01 Pubblicazione su rivista
Kawarabayashi K, Norine S, Thomas R, Wollan P
ISSN: 0095-8956
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs. (C) 2017 Published by Elsevier Inc.