A NoteConcerning Hamilton Cycles in Some Classes of Grid Graphs

A.N.M. Salman¹, E.T. Baskoro² & H.J. Broersma³

¹Faculty of Mathemathical Sciences, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Email: salman@math.utwente.nl
²The Department of Mathematics, ITB, Jalan Ganesa 10 Bandung 40132, Indonesia
Email: ebaskoro@dns.math.itb.ac.id
³Faculty of Mathematical Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Email: broersma@math.utwente.nl

A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes. In this paper we consider three classes of grid graphs, namely rectangular grid graph, eta grid graph and omega grid graph. Our main result characterizes which of these graphs are hamiltonian.

Download Article