The Kelmans-Seymour conjecture III: 3-vertices in K4-

@article{He2020TheKC,
title={The Kelmans-Seymour conjecture III: 3-vertices in K4-},
author={Dawei He and Yan Wang and Xingxing Yu},
journal={J. Comb. Theory, Ser. B},
year={2020},
volume={144},
pages={265-308}
}

As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no K5 ‐subdivision are 4‐colorable. Any possible counterexample to this conjecture with minimum number of… Expand

If a Hajos graph admits a 4-cut or 5-cut with a planar side then the planarSide must be small or contains a special wheel in the effort to reduce Hajos' conjecture to the Four Color Theorem.Expand

Abstract.In 1975, Lovász conjectured that for any positive integer k, there exists a minimum positive integer f(k) such that, for any two vertices x, y in any f(k)-connected graph G, there is a path… Expand

We prove that given any fixed edge ra in a 4-connected graph G, there exists a cycle C through ra such that G-(V(C)-{r}) is 2-connected. This will provide the first step in a decomposition for… Expand

however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)… Expand