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.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.