Enumeration of Hamiltonian circuits in rectangular grids

zbMATH Open0855.05070MaRDI QIDQ1921464FDOQ1921464

Authors: Robert Stoyan, Volker Strehl 

Publication date: 26 January 1997

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119014

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Publication:4892327
• scientific article; zbMATH DE number 888851
• scientific article; zbMATH DE number 6282146
• Enumeration of Hamiltonian cycles in a squared rectangle
• Enumeration of Hamiltonian circuits in digraphs
• The number of Hamiltonian paths in a rectangular grid
• The Hamilton circuit problem on grids
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• Enumerating Hamiltonian cycles

zbMATH Keywords

algorithmgenerating functionenumerationregular languageHamiltonian circuitsrectangular grid graphdenominator polynomialMotzkin language

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Enumerating Hamiltonian cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hamilton circuit problem on grids
• Enumeration of Hamiltonian cycles in a squared rectangle
• A matrix method for counting Hamiltonian cycles on grid graphs
• Enumeration of Hamiltonian cycles on a thick grid cylinder. I: Non-contractible Hamiltonian cycles

This page was built for publication: Enumeration of Hamiltonian circuits in rectangular grids

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