OFFSET
0,3
COMMENTS
A directed path is Hamiltonian if it passes through every vertex exactly once.
LINKS
Wikipedia, Hamiltonian path
Gus Wiseman, Enumeration of paths and cycles and e-coefficients of incomparability graphs, arXiv:0709.0430 [math.CO], 2007.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 16 2019
STATUS
approved