The Kelmans-Seymour conjecture for apex graphs
classification
🧮 math.CO
keywords
apexconjectureconnectedgraphgraphskelmans-seymournonplanarsubdivided
read the original abstract
We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_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 $K^-_{_4}$ as a subgraph has a subdivided $K_{_5}$}; this settles the Kelmans-Seymour conjecture for apex graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.