Zurück zu den Preprints des Jahres 2006


Hamiltonian Properties of Triangular Grid Graphs

by Gordon, V.S., Orlovich, Y.L., Werner, F..

Series: 2006-15, Preprints

05C38 Paths and cycles
05C45 Eulerian and Hamiltonian graphs
68Q25 Analysis of algorithms and problem complexity

A triangular grid gaph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearly-convex hull of the Star of David. We extend this result to a wider class of locally connected triangular grid graphs. Namely, we prove that all connected, locally connected triangular grid graphs (with the same exception of graph D) are hamiltonian. Moreover, we present a sufficient condition for a connected graph to be fully cycle extendable.

Hamiltonian graph, Triangular grid graph, Local connectivity, NP-completeness

This paper was published in:
Discrete Mathematics, Vol. 308, No. 24, 2008, 6166 - 6188.