A strengthening of the Kuratowski planarity criterion for 3-connected graphs

DOI10.1016/0012-365X(84)90001-3zbMath0545.05035OpenAlexW1996335482MaRDI QIDQ797592

Alexander K. Kelmans

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90001-3

zbMATH Keywords

subdivisionnon-planar graph

Mathematics Subject Classification ID

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

Related Items

A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, Maximizing the number of \(x\)-colorings of 4-chromatic graphs, A planarity criterion for cubic bipartite graphs, Cycles of length 0 modulo 4 in graphs

Cites Work

• Unnamed Item
• Unnamed Item