The Kelmans-Seymour conjecture. I: Special separations
From MaRDI portal
Publication:777488
DOI10.1016/j.jctb.2019.11.008zbMath1443.05143arXiv1511.05020MaRDI 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
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\), The Kelmans-Seymour conjecture. IV: A proof, Linking four vertices in graphs of large connectivity
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