Subdivisions in apex graphs

DOI10.1007/s12188-012-0063-xzbMath1269.05024arXiv1012.5792OpenAlexW2040827772MaRDI QIDQ2392579

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) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83) Connectivity (05C40)

Related Items (5)

Unnamed Item ⋮ Graphs Containing TopologicalH ⋮ 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

Cites Work

• Extremal results regarding \(K_6\)-minors in graphs of girth at least 5
• Independent paths and \(K_{5}\)-subdivisions
• Disjoint paths in graphs
• 2-linked graphs
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Subdivisions in planar graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Sets of Disjoint Lines in PG(3, q)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subdivisions in apex graphs