DOI Number : 10.5614/itbj.sci.2003.35.1.5
Hits : 3

A NoteConcerning Hamilton Cycles in Some Classes of Grid Graphs

A.N.M. Salman1, E.T. Baskoro2 & H.J. Broersma3

1Faculty of Mathemathical Sciences, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
2The Department of Mathematics, ITB, Jalan Ganesa 10 Bandung 40132, Indonesia
3Faculty of Mathematical Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands


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.

Keywords: rectangular grid graph, eta grid graph, omega grid graph, Hamilton cycle

Download Article
Bahasa Indonesia | English


Begin on 10 October 2014 this website is no longer activated for article process in Journal of Mathematical and Fundamental Sciences, Journal of Engineering and Technological Sciences, Journal of ICT Research and Applications and Journal of Visual Art and Design. The next process will be proceeded under new website at

For detail information please contact us to:

       ITB Journal Visitor Number #24661650       
       Jl. Tamansari 64, Bandung 40116, Indonesia Visitor IP Address #       
       Tel : +62-22-250 1759 ext. 121 2011 Institut Teknologi Bandung       
       Fax : +62-22-250 4010, +62-22-251 1215 XHTML + CSS + RSS       
       E-mail : or Developed by AVE