The Kelmans-Seymour conjecture for apex graphs

preprint2010arXivOpen access

Abstract

We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided K5K_{_5} or a K4−K^-_{_4} (= K4K_{_4} 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 K4−K^-_{_4} as a subgraph has a subdivided K5K_{_5}}; this settles the Kelmans-Seymour conjecture for apex graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.