The crossing number $\crn(G)$ of a graph $G$ is the minimal number of crossings among all embeddings of $G$ in the plane.