HamiltonianQ

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

New to Mathematica? Find your learning path »
Have a question? Ask support »