DeepAI AI Chat
Log In Sign Up

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

by   Erik D. Demaine, et al.

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we prove two of these unsolved combinations to be NP-complete: Hamiltonicity of Square Polygonal Grid Graphs and Hamiltonicity of Hexagonal Thin Grid Graphs. We also consider a new restriction, where the grid graph is both thin and polygonal, and prove that Hamiltonicity then becomes polynomially solvable for square, triangular, and hexagonal grid graphs.


page 1

page 2

page 3

page 4


Solving the Rubik's Cube Optimally is NP-complete

In this paper, we prove that optimally solving an n × n × n Rubik's Cube...

An update on the coin-moving game on the square grid

This paper extends the work started in 2002 by Demaine, Demaine and Veri...

The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations

Finding Hamitonian Cycles in square grid graphs is a well studied and im...

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...

Thinness and its variations on some graph families and coloring graphs of bounded thinness

Interval graphs and proper interval graphs are well known graph classes,...

Tree-Residue Vertex-Breaking: a new tool for proving hardness

In this paper, we introduce a new problem called Tree-Residue Vertex-Bre...

Tatamibari is NP-complete

In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an ...