Is following decision problem NP-hard / NP-complete:

- Having vertex-induced subgraph of rectangular lattice graph determine if any Hamiltonian path exists
- Having vertex-induced subgraph of rectangular lattice graph determine if exists Hamiltonian path starting at given point (path end can be anywhere)

Please give me some references.