3 papers
math.CO2016
The Kelmans-Seymour conjecture IV: a proof
Dawei He, Yan Wang, Xingxing Yu
A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of or . Wagner proved in 1937 that if a g…
math.CO2016
The Kelmans-Seymour conjecture III: 3-vertices in
Dawei He, Yan Wang, Xingxing Yu
Let be a 5-connected nonplanar graph and let be distinct, such that and . We show that one of t…
math.CO2016
The Kelmans-Seymour conjecture II: 2-vertices in
Dawei He, Yan Wang, Xingxing Yu
We use to denote the graph obtained from by removing an edge, and use to denote a subdivision of . Let be a 5-connected nonplanar graph and $\{x_1,x_2…