HamiltonianCycle

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

HamiltonianCycle[g]

finds a Hamiltonian cycle in graph g if one exists.

HamiltonianCycle[g,All]

gives all Hamiltonian cycles of graph g.

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]=

HamiltonianCycle has been superseded by FindHamiltonianCycle:

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

See Also

FindHamiltonianCycle  EulerianCycle  HamiltonianQ  HamiltonianPath

Tutorials