1 citations · 1 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
The Kelmans-Seymour conjecture I: special separations
Dawei He, Yan Wang, Xingxing Yu
Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of . This conjecture was proved by Ma and Yu for gra…
On the number of a SDRs of a valued (t,n)-family
Dawei He, Changhong Lu
A system of distinct representatives (SDR) of a family is a sequence of distinct elements with for .…