The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)

DOI10.1016/J.JCTB.2019.11.006zbMath1443.05145arXiv1609.05747OpenAlexW2287828383MaRDI QIDQ777490

Xingxing Yu, Dawei He, 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/1609.05747

zbMATH Keywords

planar graphindependent pathssubdivision of graphnonseparating path

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (5)

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. IV: A proof ⋮ Rooted topological minors on four vertices

Cites Work

• Independent paths and \(K_{5}\)-subdivisions
• The Kelmans-Seymour conjecture. I: Special separations
• The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
• Disjoint paths in graphs
• 2-linked graphs
• Graph minors. IX: Disjoint crossed paths
• Contractible edges and triangles in \(k\)-connected graphs
• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• Applications of Menger's graph theorem
• A Polynomial Solution to the Undirected Two Paths Problem
• Cycles and Connectivity in Graphs

This page was built for publication: The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)