"KURATOWSKI GRAPHS": THE SIMPLEST NONPLANAR GRAPHS

A graph is planar iff it does not contain one of the following graphs (respectively, K5 and K3,3) as a subgraph: