The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
From MaRDI portal
Publication:777489
DOI10.1016/j.jctb.2019.11.007zbMath1443.05144arXiv1602.07557OpenAlexW2994710724MaRDI QIDQ777489
Dawei He, Xingxing Yu, Yan Wang
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/1602.07557
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
- Non-separating paths in 4-connected graphs
- Graph minors. IX: Disjoint crossed paths
- Applications of Menger's graph theorem
- A Polynomial Solution to the Undirected Two Paths Problem
- Nonseparating Cycles in 4-Connected Graphs
- Cycles and Connectivity in Graphs
This page was built for publication: The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
