COUNTING HAMILTONIAN CYCLES ON PLANAR RANDOM LATTICES
1998 ◽
Vol 13
(09)
◽
pp. 727-733
◽
Keyword(s):
A Hamiltonian cycle of a graph is a closed path if it passs through each of the vertices once and only once. In this letter, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles is obtained and its singularity is studied. Its relation with two-dimensional quantum gravity is discussed.
1991 ◽
Vol 06
(15)
◽
pp. 2743-2754
◽
Keyword(s):
2010 ◽
Vol 20
(6)
◽
pp. 1091-1098
◽
Keyword(s):
2017 ◽
Vol 32
(31)
◽
pp. 1750180
Keyword(s):