Note on k-planar crossing numbers

János Pach, László A. Székely, Csaba D. Tóth +1

The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of…