Hamiltonicity in Semi-Regular Tessellation Dual Graphs

09/30/2019

∙

by   Divya Gopinath, et al.

∙

0

∙

share

This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows up on prior studies of the complexity of finding Hamiltonian cycles in regular and semi-regular grid graphs.