A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs

Authors

  • A. N.M. Salman Faculty of Mathematical Sciences, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands
  • E. T. Baskoro The Department of Mathematics, ITB Jalan Ganesa 10 Bandung 40132, Indonesia
  • H. J. Broersma Faculty of Mathematical Sciences, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands

DOI:

https://doi.org/10.5614/itbj.sci.2003.35.1.5

Abstract

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.

Downloads

Issue

Vol. 35 No. 1 (2003)

Section

Articles