Abstract
Let be a 5-connected nonplanar graph and let be distinct, such that and . We show that one of the following holds: contains , or contains a in which is of degree 2, or contains a in which is not a branch vertex, or may be chosen so that for any distinct , contains . This result will be used to prove the Kelmans-Seymour conjecture.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.