MHB Finding Hamilton Cycles by hand

AI Thread Summary
Finding Hamiltonian cycles can be challenging, and while no definitive algorithms exist, several guidelines can assist in the process. A key tip is that a vertex with degree 2 allows only one path through it. Additionally, there are algorithms available that can help identify Hamiltonian cycles, which are briefly summarized in the discussion. Understanding these strategies can enhance the search for Hamiltonian cycles in graphs. Engaging with these concepts can lead to more effective cycle discovery.
annie122
Messages
51
Reaction score
0
I know there are no algorithms for finding one, but what are some guidelines?
One tip I came up with is that if you have a vertex with degree 2, there is only one way to go through that vertex.

Are there any others?
 
Physics news on Phys.org
Yuuki said:
I know there are no algorithms for finding one, but what are some guidelines?
One tip I came up with is that if you have a vertex with degree 2, there is only one way to go through that vertex.

Are there any others?

Hi Yuuki, :)

There are algorithms to find Hamiltonian cycles, some of which are summarized >>here<<.
 

Similar threads

Back
Top