|
|
A185360
|
|
Number of almost Hamiltonian simple graphs on n vertices.
|
|
0
|
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Using the definition that a graph is "almost Hamiltonian" if its Hamiltonian length (length of a Hamiltonian walk) is one greater than the vertex count.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|