crossing numberThe crossing number cr(G) of a graph (http://planetmath.org/Graph) G is the minimal number of crossings among all embeddings of G in the plane.