The number of Hamiltonian paths in a rectangular grid

DOI10.1016/0012-365X(95)00330-YzbMath0879.05035MaRDI QIDQ1357721

Lucia B. Krompart, Karen L. Collins

Publication date: 12 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionHamiltonian pathsgrid

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids ⋮ Fault-tolerant Hamiltonicity in a class of faulty meshes ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Some new characterizations of Hamiltonian cycles in triangular grid graphs ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

Cites Work

• Enumeration of Hamiltonian cycles in a squared rectangle
• On the number of Hamiltonian cycles of \(P_ 4\times{} P_ n\)
• Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs
• Hamiltonian Properties of Grid Graphs
• Hamilton Paths in Grid Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of Hamiltonian paths in a rectangular grid