The Minor Crossing Number
Drago Bokal, Gašper Fijavž, Bojan Mohar · SIAM Journal on Discrete Mathematics · 2006
The minor crossing number of a graph G is defined as the minimum crossing number of all graphs that contain G as a minor. Basic properties of this new invariant are presented. We study topological structure of graphs with bounded minor crossing number and obtain a new strong version of a lower bound based on the genus. We also give a generalization of an inequality of Moreno and Salazar crossing numbers of a graph and its minors.