Kurathowski's Criterion

A graph is non-planar if and only if it contains a subdivision of K5 or K3,3. Kurathowski's criterion provides a strict check for planarity and is important for circuit design and visualization