A graph that can be drawn in the plane without edge crossings. Kuratowski: a graph is planar ⇔ it contains no subdivision of K₅ or K₃,₃.
A graph that can be drawn in the plane without edge crossings. Kuratowski: a graph is planar ⇔ it contains no subdivision of K₅ or K₃,₃.