A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs

DOI10.7151/DMGT.2021zbMath1390.05099OpenAlexW2773997357WikidataQ123133150 ScholiaQ123133150MaRDI QIDQ1708388

Rade Doroslovački, Harris Kwong, Olga Bodroža-Pantić, Milan R. Pantić

Publication date: 23 March 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2021

zbMATH Keywords

generating functionscontractible Hamiltonian cyclesthin triangular grid cylinder graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs ⋮ Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles

Cites Work

• Some new characterizations of Hamiltonian cycles in triangular grid graphs
• Enumeration of Hamiltonian cycles in a squared rectangle
• A matrix method for counting Hamiltonian cycles on grid graphs
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• On the number of Hamiltonian cycles of \(P_ 4\times{} P_ n\)
• Self-avoiding walks and polygons on the triangular lattice
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs