A k-planar graph is a graph in which each edge is allowed to be crossed at most k times. The least nonnegative integer k such that a graph has a k-planar drawing is known as its local crossing number.

1-planar graph | 2-planar graph | local crossing number