OFFSET
0,5
COMMENTS
A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once.
LINKS
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 9766535.
Wikipedia, Hamiltonian path
MATHEMATICA
Table[Length[Select[Subsets[Subsets[Range[n], {2}]], FindHamiltonianCycle[Graph[Range[n], #]]!={}&]], {n, 0, 4}] (* Mathematica 8.0+ *)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 15 2019
EXTENSIONS
a(7)-a(11) added using tinygraph by Falk Hüffner, Jun 21 2019
STATUS
approved