Abstract.
There is only one finite, 2-connected, linearly convex graph in the Archimedean triangular tiling that does not have a Hamiltonian cycle.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 26, 1999, and in revised form April 2, 1999. Online publication May 16, 2000.
Rights and permissions
About this article
Cite this article
Reay, J., Zamfirescu, T. Hamiltonian Cycles in T-Graphs. Discrete Comput Geom 24, 497–502 (2000). https://doi.org/10.1007/s004540010051
Issue Date:
DOI: https://doi.org/10.1007/s004540010051