0

Can you provide the specific formula for calculating the maximum number of turns in a Hamiltonian cycle on an m×n lattice graph, given that m and n are both even numbers greater than 2?

Luke Wardford
  • 1
  • 1
    Welcome to MSE. Your question is phrased as an isolated problem, without any further information or context. This does not match many users' quality standards, so it may attract downvotes, or closed. To prevent that, please [edit] the question. This will help you recognise and resolve the issues. Concretely: please provide context, and include your work and thoughts on the problem. These changes can help in formulating more appropriate answers. – José Carlos Santos Oct 02 '23 at 12:16
  • Relevant older post? https://math.stackexchange.com/questions/58904/maximum-number-of-turns-on-a-hamiltonian-cycle – dbal Oct 02 '23 at 14:28
  • Following an additional link under dbal's thread, this paper appears to provide the answer. – Paul Sinclair Oct 03 '23 at 11:52

0 Answers0