The number of Hamiltonian paths in a rectangular grid

Discrete Mathematics

Volumn 169, Issue 1-3, 1997, Pages 29-38

  Collins, Karen L ^a   Krompart, Lucia B ^b  

^a WESLEYAN UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042547174     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00330-Y     Document Type: Article

References (14)

1. E. Coven. B. Kitchens and S. Silberger. personal communication. 1995.
2. H. Everett, Finding Hamiltonian paths in nonrectangular grid graphs, Congr. Numer. 53 (1986) 185-192.
3. F. Göbel, Hamilton cycles in product graphs, Technische Hogeschool Twente Memorandum Nr. 268 (1979).
4. F. Göbel, On the number of Hamilton cycles in product graphs, Technische Hogeschool Twente Memorandum Nr. 289 (1979).
5. A. Itai, C.H. Papadimitriou and J.L. Szwarcfiter, Hamilton paths in grid graphs, SIAM J. Comput. 11 (1982) 676-686.
6. G. Kreweras, Dénombrement des Cycles Hamiltoniens dans un Rectangle Quadrillé, European J. Combin. 13 (1992) 473-476.
7. n, Ars Combin. 33 (1992) 87-96.
8. F. Luccio and C. Mugnai, Hamiltonian paths on a rectangular chessboard, in: 16th Ann. Allerton Conf. (1978) 73-78.
9. H. Niederhausen, How many paths cross at least / given lattice points? Congr. Numer. 36 (1982) 161-173.
10. B.R. Myers, Enumeration of tours in Hamiltonian rectangular lattice graphs. Math. Mag. 54 (1981) 19-23.
11. R.P. Stanley, Enumerative Combinatorics, vol. 1 (Wadsworth and Brooks Cole, Monterey CA, 1986).
12. R. Stoyan, Anzahl der Hamilton-Kreise in Rechteckigen Gettern, Thesis, University of Erlangen-Nuernberg, Erlangen, Germany, 1993.
13. n, Indian J. Pure Appl. Math. 21 (1990) 403-409.
14. C. Zamfirescu and T. Zamfirescu, Hamiltonian properties of grid graphs, SIAM J. Discrete Math. 5 (1992) 564-570.