A matrix method for counting Hamiltonian cycles on grid graphs

DOI10.1006/eujc.1994.1031zbMath0798.05032OpenAlexW2022935467MaRDI QIDQ1329078

Y. H. Harris Kwong, Douglas G. Rogers

Publication date: 20 October 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1031

zbMATH Keywords

countingHamiltonian cyclesgrid graphsmatrix method

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Thin Hamiltonian cycles on Archimedean graphs ⋮ Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Some new characterizations of Hamiltonian cycles in triangular grid graphs ⋮ A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs ⋮ Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles

This page was built for publication: A matrix method for counting Hamiltonian cycles on grid graphs