by Gordon, V.S., Orlovich, Y.L., Werner, F..
Series: 2007-04, Preprints
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. We show that the problem Hamiltonian Cycle is NP-complete for triangular grid graphs, while a hamiltonian cycle in a connected, locally connected triangular grid graph can be found in polynomial time.
Hamiltonian cyle problem, Triangular grid graphs, Complexity
This paper was published in:
Discrete Mathematics, Vol. 308, No. 24, 2008, 6166 - 6188 as a part of the paper with the title `Hamiltonian properties of triangular grid graphs'.