Hypohamiltonian Graphs and their Crossing Number Carol T. Zamfirescu DOI: https://doi.org/10.37236/2291 Keywords: Hypohamiltonian graphs, Crossing number Abstract We prove that for every $k \ge 0$ there is an integer $n_0(k)$ such that, for every $n \ge n_0$, there exists a hypohamiltonian graph which has order $n$ and crossing number $k$. PDF Published 2012-10-25 Issue Volume 19, Issue 4 (2012) Article Number P12