Drago Bokal (1), Gašper Fijavž (2), Bojan Mohar (3) (4)
(1) Institute of Mathematics, Physics and Mechanics [Ljubljana]
(2) Faculty of Computer and Information Science [Ljubljana]
(3) Department of Mathematics
(4) Faculty of Mathematics and Physics [Ljubljana]
Abstract
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$.
