Enumeration of Hamiltonian cycles in a squared rectangle

DOI10.1016/0195-6698(92)90005-KMaRDI QIDQ1202737zbMATH OpenOpenAlexFDO

Authors Germain Kreweras

Publication date 3 February 1993

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

Full work available at URL https://doi.org/10.1016/0195-6698(92)90005-k

zbMATH Keywords

enumerationgenerating functionsHamiltonian cyclessquared rectangle

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of Hamiltonian circuits in rectangular grids
• Publication:4892327
• A matrix method for counting Hamiltonian cycles on grid graphs
• scientific article; zbMATH DE number 68341
• Enumerating Hamiltonian cycles

Cites work

• Algebraic languages and polyominoes enumeration

Cited in

(8)

• The number of Hamiltonian paths in a rectangular grid
• A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
• Thin Hamiltonian cycles on Archimedean graphs
• Enumeration of Hamiltonian circuits in rectangular grids
• The Square of a Hamiltonian Cycle
• scientific article; zbMATH DE number 927054 (Why is no real title available?)
• Enumeration of Hamiltonian cycles on a thick grid cylinder. I: Non-contractible Hamiltonian cycles
• Some new characterizations of Hamiltonian cycles in triangular grid graphs

This page was built for publication: Enumeration of Hamiltonian cycles in a squared rectangle

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