29 citations · 142 across the 19 of their papers we have counts for
Showing 1998Show all
3 papers · 1 filter
cond-mat.stat-mech1998★ 7 cited
Compact polymers on decorated square lattices
Saburo Higuchi
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltoni…
cond-mat.stat-mech1998
Hamiltonian cycles on random lattices of arbitrary genus
Saburo Higuchi
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices wit…
cond-mat.stat-mech1998★ 5 cited
Counting Hamiltonian cycles on planar random lattices
Saburo Higuchi
A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered.…