On the Crossing Number of Complete Graphs with an Uncrossed Hamiltonian Cycle

Abstract

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.