Hypohamiltonian graphs and their crossing number
Summary: We prove that for every \(k \geq 0\) there is an integer \(n_0(k)\) such that, for every \(n \geq n_0\), there exists a hypohamiltonian graph which has order \(n\) and crossing number \(k\).
scientific article; zbMATH DE number 6171795