Hamiltonicity in Semi-Regular Tessellation Dual Graphs
Computational Complexity
2019-10-01 v1 Computational Geometry
Abstract
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.
Cite
@article{arxiv.1909.13755,
title = {Hamiltonicity in Semi-Regular Tessellation Dual Graphs},
author = {Divya Gopinath and Rohan Kodialam and Kevin Lu and Jayson Lynch and Santiago Ospina},
journal= {arXiv preprint arXiv:1909.13755},
year = {2019}
}