Google
×

Crossing number

Graph theory
In graph theory, the crossing number cr of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is planar if and only if its crossing number is zero. Wikipedia