A graph G is hypohamiltonian if G is non-hamiltonian and G-v is hamiltonian for every vertex v of G. A graph G is almost hypohamiltonian if G is non-hamiltonian and there exists a vertex w of G such that G-w is non-hamiltonian and G-v is hamiltonian for every vertex v of G different from w.
The graph lists are currently only available in 'graph6' format.
The following lists are available:
Lists of hypohamiltonian graphs can be found here.
The counts of incomplete cases are indicated with a '≥' in the table. In all other cases the numbers are the counts of the complete sets of almost hypohamiltonian graphs.
The following table gives the complete lists of all almost hypohamiltonian graphs with a given lower bound on the girth.
|Vertices||girth ≥ 3||girth ≥ 4||girth ≥ 5||girth ≥ 6|
The graphs in this section were obtained by applying a generator for cubic graphs (see the cubic graphs page) and testing the generated graphs for almost hypohamiltonicity as a filter.
The following table give the complete lists of all cubic almost hypohamiltonian graphs with a given lower bound on the girth. (Note that cubic almost hypohamiltonian graphs must have girth at least 4). More information about these graphs can be found in .
|Vertices||girth ≥ 4||girth ≥ 5||girth ≥ 6|