Edge‐minimum saturated k $k$‐planar drawings
Edge‐minimum saturated k $k$‐planar drawings
Abstract For a class of drawings of loopless (multi‐)graphs in the plane, a drawing is saturated when the addition of any edge to results in —this is analogous to saturated graphs in a graph class as introduced by Turán and Erdős, Hajnal, and Moon. We focus on ‐planar drawings, that …