The Minor Crossing Number of Graphs with an Excluded Minor

Abstract

The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at most $c|V(G)|$.

Cited by in corpus (2)

• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
• Probabilistic Methods on Erdos Problems