1 paper
Divya Gopinath, Rohan Kodialam, Kevin Lu +2
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 clas…