论文信息 - COUNTING HAMILTONIAN CYCLES ON PLANAR RANDOM LATTICES

COUNTING HAMILTONIAN CYCLES ON PLANAR RANDOM LATTICES

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.

S. Higuchi

[1] B. Eynard,et al. Hamiltonian cycles on a random three-coordinate lattice , 1998, cond-mat/9801281.

[2] Suzuki,et al. Exact results for Hamiltonian walks from the solution of the fully packed loop model on the honeycomb lattice. , 1994, Physical review letters.

[3] N. Ishibashi. 2D string theory coupled to quantum gravity , 1993, hep-th/9305061.

[4] B. Duplantier,et al. Geometrical critical phenomena on a random surface of arbitrary genus , 1990 .

[5] Duplantier,et al. Conformal spectra of polymers on a random surface. , 1988, Physical review letters.

[6] J. Suzuki. Evaluation of the connectivity of Hamiltonian paths on regular lattices , 1988 .

[7] E. Lieb. Exact Solution of the Problem of the Entropy of Two-Dimensional Ice , 1967 .

[8] P. W. Kasteleyn. A soluble self-avoiding walk problem*) , 1963 .

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .