Hypohamiltonian graphs and their crossing number (Q1953317)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hypohamiltonian graphs and their crossing number |
scientific article; zbMATH DE number 6171795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hypohamiltonian graphs and their crossing number |
scientific article; zbMATH DE number 6171795 |
Statements
Hypohamiltonian graphs and their crossing number (English)
0 references
7 June 2013
0 references
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\).
0 references
hypohamiltonian graphs
0 references
crossing number
0 references
