Abstract
There is only one finite, 2-connected, linearly convex graph in the Archimedean triangular tiling that does not have a Hamiltonian cycle.
Cite
CITATION STYLE
APA
Reay, J. R., & Zamfirescu, T. (2000). Hamiltonian cycles in T-graphs. Discrete and Computational Geometry, 24(2–3), 497–502. https://doi.org/10.1007/s004540010051
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free