Cubic hypohamiltonian graphs
Last update: 15 Dec 2020
| Contains: 666 graphs
A graph is hypohamiltonian if it does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. The following collection was calculated by the House of Graphs (source
) and lists all cubic hypohamiltonian graphs on up to 32 vertices.