The Kelmans-Seymour conjecture. II: 2-vertices in K₄^-

DOI10.1016/J.JCTB.2019.11.007MaRDI QIDQ777489zbMATH OpenOpenAlexFDO

Authors Da-Wei He, Yan Wang, Xingxing Yu

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

zbMATH Keywords

independent pathsnonseparating pathplanar graphsubdivision of graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: We use $K_4^{-}$ to denote the graph obtained from $K_4$ by removing an edge, and use $T{K}_5$ to denote a subdivision of $K_5$. Let $G$ be a 5-connected nonplanar graph and $x_1,x_2,y_1,y_{2}subseteqV(G)$ such that $$ $$ with $y_1{y}_{2}otinE(G)$. Let $w_1,w_2,w_{3}inN(y_2)-x_1,x_2$ be distinct. We show that $G$ contains a $T{K}_5$ in which $y_2$ is not a branch vertex, or $G-y_2$ contains $K_4^{-}$, or $G$ has a special 5-separation, or $G-y_{2}v:votin{w}_1,w_2,w_3,x_1,x_2$ contains $T{K}_5$.

Recommendations

• The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. I: Special separations
• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• Subdivisions in apex graphs
• The Kelmans-Seymour conjecture. IV: A proof

Cites work

• 2-linked graphs
• A Polynomial Solution to the Undirected Two Paths Problem
• Applications of Menger's graph theorem
• Cycles and Connectivity in Graphs
• Disjoint paths in graphs
• Graph minors. IX: Disjoint crossed paths
• Independent paths and \(K_{5}\)-subdivisions
• Non-separating paths in 4-connected graphs
• Nonseparating Cycles in 4-Connected Graphs

Cited in

(11)

• Rooted topological minors on four vertices
• Subdivisions in apex graphs
• Linking four vertices in graphs of large connectivity
• Wheels in planar graphs and Hajós graphs
• 4‐Separations in Hajós graphs
• Chasing tripods to obtain a rooted subdivision
• The dominating 4-colour theorem
• The Kelmans-Seymour conjecture. I: Special separations
• The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. IV: A proof
• Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777489)