Hamiltonian cycles in polyhedral maps.

We present a necessary and sufficient condition for existence of a contractible, non-separating and non-contractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. We also present algorithms to construct such cycles whenever it exists where one of them is linear time and another is exponential time algorithm. [ABSTRACT FROM AUTHOR]