Subdivisions in apex graphs

DOI10.1007/S12188-012-0063-XMaRDI QIDQ2392579zbMATH OpenOpenAlexFDO

Authors Elad Aigner-Horev

Publication date 2 August 2013

Published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.5792

zbMATH Keywords

apex graphsnonseparating pathsrooted subdivisions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Abstract: The Kelmans-Seymour conjecture states that the 5-connected nonplanar graphs contain a subdivided $K_{{}_5}$. Certain questions of Mader propose a "plan" towards a possible resolution of this conjecture. One part of this plan is to show that a 5-connected nonplanar graph containing $K_{{}_4}^{-}$ or $K_{{}_{2,3}}$ as a subgraph has a subdivided $K_{{}_5}$. Recently, Ma and Yu showed that a 5-connected nonplanar graph containing $K_{{}_4}^{-}$ as a subgraph has a subdivided $K_{{}_5}$. We take interest in $K_{{}_{2,3}}$ and prove that a 5-connected nonplanar apex graph containing $K_{{}_{2,3}}$ as a subgraph has a subdivided $K_{{}_5}$

Recommendations

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

Cites work

• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• 2-linked graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Disjoint paths in graphs
• Extremal results regarding \(K_6\)-minors in graphs of girth at least 5
• Graphs on surfaces
• Independent paths and \(K_{5}\)-subdivisions
• Sets of Disjoint Lines in PG(3, q)
• Subdivisions in planar graphs
• \(3n-5\) edges do force a subdivision of \(K_5\)

Cited in

(10)

• The Kelmans-Seymour conjecture. I: Special separations
• The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. IV: A proof
• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• Weighted Harary indices of apex trees and \(k\)-apex trees
• Extremal first leap Zagreb index of \(k\)-generalized quasi-trees
• Graphs containing topological \(H\)
• Independent paths and \(K_{5}\)-subdivisions
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5

This page was built for publication: Subdivisions in apex graphs

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