algorithm;
* Schnyder's theorem gives a characterization of planarity in terms of partial order dimension;
* Colin de Verdière's planarity criterion gives a characterization based on the maximum multiplicity of the second eigenvalue of certain Schrödinger operators defined by the graph.
* The Hanani-Tutte theorem states that a graph