Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Graphs & Networks > Paths and Cycles > FindHamiltonianCycle >
Mathematica > Visualization and Graphics > Graphs & Networks > Paths and Cycles > FindHamiltonianCycle >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

FindHamiltonianCycle

FindHamiltonianCycle[g]
finds a Hamiltonian cycle in the graph g if one exists.
MORE INFORMATION
  • A Hamiltonian cycle visits each vertex exactly once.
EXAMPLESCLOSE ALL
Basic Examples   (1)
Find a Hamiltonian cycle:
Turn the result into a cycle graph and highlight it:
Find a Hamiltonian cycle:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Turn the result into a cycle graph and highlight it:
In[3]:=
Click for copyable input
Out[3]=
Applications   (1)
Solve the Icosian game, that is, find a Hamiltonian cycle along the edges of the dodecahedron:
New in 8
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF