Hamiltonian cycles in T-graphs

DOI10.1007/s004540010051zbMath0953.05040OpenAlexW2080396663MaRDI QIDQ1580773

John R. Reay, Tudor I. Zamfirescu

Publication date: 23 January 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010051

zbMATH Keywords

Hamiltonian cycleArchimedean triangular tilingT-graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Hamiltonian cycles in linear-convex supergrid graphs ⋮ The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ The Hamiltonian properties of supergrid graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian properties of triangular grid graphs ⋮ Rikudo is NP-complete

This page was built for publication: Hamiltonian cycles in T-graphs