A matrix method for counting Hamiltonian cycles on grid graphs

DOI10.1006/EUJC.1994.1031MaRDI QIDQ1329078zbMATH OpenOpenAlexFDO

Authors 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

countinggrid graphsHamiltonian cyclesmatrix method

Mathematics Subject Classification ID

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

Recommendations

• Enumerating Hamiltonian cycles
• scientific article; zbMATH DE number 1123890
• Enumeration of Hamiltonian circuits in rectangular grids
• scientific article; zbMATH DE number 68341
• scientific article; zbMATH DE number 6282146

Cited in

(20)

• Enumeration of Hamiltonian cycles in a squared rectangle
• A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
• Thin Hamiltonian cycles on Archimedean graphs
• Enumeration of Hamiltonian Cycles and Paths in a Graph
• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Counting paths in a grid
• scientific article; zbMATH DE number 68341 (Why is no real title available?)
• scientific article; zbMATH DE number 1123890 (Why is no real title available?)
• A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
• Enumerating Hamiltonian cycles
• scientific article; zbMATH DE number 809165 (Why is no real title available?)
• scientific article; zbMATH DE number 1389218 (Why is no real title available?)
• Enumeration of Hamiltonian cycles on a thick grid cylinder. I: Non-contractible Hamiltonian cycles
• scientific article; zbMATH DE number 6282146 (Why is no real title available?)
• A direct method for calculating cell cycles of a block map of a simple planar graph
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
• Enumerating maximal dissociation sets in three classes of grid graphs
• The Hamiltonian path graph is connected for simple s,t paths in rectangular grid graphs
• The number of n-cycles in a graph
• Some new characterizations of Hamiltonian cycles in triangular grid graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329078)