Some new characterizations of Hamiltonian cycles in triangular grid graphs

DOI10.1016/j.dam.2015.07.028zbMath1329.05176OpenAlexW1947311677MaRDI QIDQ908287

Harris Kwong, Olga Bodroža-Pantić, Milan R. Pantić

Publication date: 4 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.028

zbMATH Keywords

Hamiltonian cyclestriangular grid graphs

Mathematics Subject Classification ID

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

Related Items

A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs, The Sock Problem Revisited, Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles

Cites Work

• Enumeration of Hamiltonian cycles in a squared rectangle
• A matrix method for counting Hamiltonian cycles on grid graphs
• The number of Hamiltonian paths in a rectangular grid
• On the number of Hamiltonian cycles of \(P_ 4\times{} P_ n\)
• On \(abab\)-free and \(abba\)-free set partitions
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Motzkin numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item