A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs

We continue our research in the enumeration of Hamiltonian cycles (HCs) on thin cylinder grid graphs Cm × Pn+1 by studying a triangular variant of the problem. There are two types of HCs, distinguished by whether they wrap around the cylinder. Using two characterizations of these HCs, we prove that, for fixed m, the number of HCs of both types satisfy some linear recurrence relations. For small m, computational results reveal that the two numbers are asymptotically the same. We conjecture that this is true for all m ≥ 2

A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs

We continue our research in the enumeration of Hamiltonian cycles (HCs) on thin cylinder grid graphs Cm × Pn+1 by studying a triangular variant of the problem. There are two types of HCs, distinguished by whether they wrap around the cylinder. Using two characterizations of these HCs, we prove that, for fixed m, the number of HCs of both types satisfy some linear recurrence relations. For small m, computational results reveal that the two numbers are asymptotically the same. We conjecture that this is true for all m ≥ 2