The Kelmans-Seymour conjecture. I: Special separations
From MaRDI portal
Publication:777488
DOI10.1016/j.jctb.2019.11.008zbMath1443.05143arXiv1511.05020OpenAlexW2995542870MaRDI QIDQ777488
Xingxing Yu, Yan Wang, Dawei He
Publication date: 7 July 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05020
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Linking four vertices in graphs of large connectivity ⋮ Wheels in planar graphs and Hajós graphs ⋮ 4‐Separations in Hajós graphs ⋮ The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Rooted topological minors on four vertices
Cites Work
- Independent paths and \(K_{5}\)-subdivisions
- Disjoint paths in graphs
- 2-linked graphs
- Contractible edges and triangles in \(k\)-connected graphs
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Applications of Menger's graph theorem
- Graphs Containing TopologicalH
- A Polynomial Solution to the Undirected Two Paths Problem
- Cycles and Connectivity in Graphs
This page was built for publication: The Kelmans-Seymour conjecture. I: Special separations
