A simple undirected graph G = (V, E) is k-planar if it can be drawn in the plane such that each edge is crossed at most k times, incident edges do not cross, and a pair of edges must not cross twice. Such graphs have attracted many graph drawers, see and the references given there.
展开▼
