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 g, or in other words, if there exists a cycle that visits each vertex exactly once.

Details

Examples

Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=

HamiltonianQ has been superseded by HamiltonianGraphQ:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=

See Also

HamiltonianGraphQ  EulerianQ  HamiltonianCycle

Tutorials