Theorem: Characterization of Planar Graphs

An undirected graph \(G\) is planar, if any only if it contains no subdivision of the complete graph \(K_5\) or the complete bipartite graph \(K_{3,3}\).

This result is due to the Polish mathematician Kazimierz Kuratowski.

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!