Abstract
A graph G is hypohamiltonian if G is non-hamiltonian and for every vertex v in G, the graph G-v is hamiltonian. McKay asked in [J. Graph Theory 85 (2017) 7-11] whether infinitely many planar cubic hypohamiltonian graphs of girth5 exist. We settle this question affirmatively.
| Original language | English |
|---|---|
| Pages (from-to) | 40-45 |
| Number of pages | 6 |
| Journal | Journal of Graph Theory |
| Volume | 88 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - May 2018 |
| Externally published | Yes |
Keywords
- Cubic
- Dot product
- Hamiltonian
- Hypohamiltonian
- Planar