Do 3n − 5 edges force a subdivision ofK5?

DOI10.1002/jgt.3190150405zbMath0747.05037OpenAlexW2100595110MaRDI QIDQ3980622

Patrick J. McGuinness, André E. Kézdy

Publication date: 26 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150405

zbMATH Keywords

Euler characteristicsimple graphDirac's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (9)

Dirac's conjecture on \(K_ 5\)-subdivisions ⋮ Subdivisions in planar graphs ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ What is on his mind? ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ Graphs Containing TopologicalH ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)

Cites Work

• Unnamed Item

This page was built for publication: Do 3n − 5 edges force a subdivision ofK5?