On a Crossing Number Result of Richter and Thomassen

We show that if G is a graph minimal with respect to having crossing number at least k, and G has no vertices of degree 3, then G has crossing number at most 2k+35.