HamiltonianQ

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

HamiltonianQ[g]
yields True if there exists a Hamiltonian cycle in graph , or in other words, if there exists a cycle that visits each vertex exactly once.

DetailsDetails