Minor crossing number is additive over arbitrary cuts

Drago Bokal, Markus Chimani, Jesús Leaños

We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to…