Minor-monotone crossing number
Drago Bokal, Gašper Fijavž, Bojan Mohar · Discrete Mathematics & Theoretical Computer Science · 2005
The minor crossing number of a graph $G$, $rmmcr(G)$, is defined as the minimum crossing number of all graphs that contain $G$ as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mmcr for some important graph families using the topological structure of graphs satisfying \$mcr(G) ≤k$.