K5-Subdivisions in graphs containing K-4


Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5. In this paper, we prove this conjecture for graphs containing K− 4 . AMS Subject Classification: 05C 
DOI: 10.1016/j.jctb.2013.09.006

1 Figure or Table


  • Presentations referencing similar topics