Thin Hamiltonian cycles on Archimedean graphs

DOI10.1016/0195-6698(95)90057-8zbMath0822.05043OpenAlexW2005607761MaRDI QIDQ1891368

John R. Reay, Douglas G. Rogers

Publication date: 30 May 1995

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

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90057-8

zbMATH Keywords

graph invariantsArchimedean tilingarea functionsArchimedean graphsthin Hamiltonian cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of tessellation and tiling problems (05B45) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The boundary characteristic and Pick's theorem in the Archimedean planar tilings
• Enumeration of Hamiltonian cycles in a squared rectangle
• A matrix method for counting Hamiltonian cycles on grid graphs
• Pick's Theorem
• Unnamed Item

This page was built for publication: Thin Hamiltonian cycles on Archimedean graphs