The Kelmans-Seymour conjecture for apex graphs
arXiv:1012.5793
Abstract
We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided or a (= with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar 5-connected graph containing as a subgraph has a subdivided }; this settles the Kelmans-Seymour conjecture for apex graphs.
10 pages, submitted on August 10th 2010