arXiv Analytics

Sign in

arXiv:1405.1599 [math.CO]AbstractReferencesReviewsResources

Hamiltonian Cycles in Polyhedral Maps

Dipendu Maity, Ashish Kumar Upadhyay

Published 2014-05-07Version 1

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an algorithm to construct such cycles whenever it exists.

Related articles: Most relevant | Search more
arXiv:1202.4150 [math.CO] (Published 2012-02-19)
Contractible Hamiltonian Cycles in Polyhedral Maps
arXiv:1406.5615 [math.CO] (Published 2014-06-21, updated 2014-07-11)
Triangulated map with minimum degree four is Hamiltonian
arXiv:1607.03836 [math.CO] (Published 2016-07-13)
A Sufficient Condition for Graphic Lists with Given Largest and Smallest Entries, Length, and Sum