or K_3,3 (the utility graph, a complete bipartite graph on six vertices, three of which connect to each of the other three).
*Wagner's theorem that a graph is planar if and only if it does not contain a minor (subgraph of a contraction) that is isomorphic to K₅ or K_3,3.
*The Fraysseix-Rosenstiehl planarity criterion,