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

DOI10.1016/j.jctb.2019.11.006zbMath1443.05145arXiv1609.05747MaRDI 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 graph; independent paths; subdivision of graph; nonseparating path

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C40: Connectivity

Related Items

The Kelmans-Seymour conjecture. IV: A proof, Linking four vertices in graphs of large connectivity

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