×

zbMATH — the first resource for mathematics

Hypohamiltonian graphs and their crossing number. (English) Zbl 1266.05079
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\).

MSC:
05C45 Eulerian and Hamiltonian graphs
05C10 Planar graphs; geometric and topological aspects of graph theory
PDF BibTeX XML Cite
Full Text: Link