Spanning 2-connected subgraphs in truncated rectangular grid graphs

A.N.M. Salman, E.T. Baskoro, H.J. Broersma

Research output: Book/ReportReportOther research output

91 Downloads (Pure)


A grid graph is a finite induced subgraph of the infinite 2-dimensio- nal grid defined by $Z \times Z$ and all edges between pairs of vertices from $Z \times Z$ at Euclidean distance precisely 1. An $m\times n$-rectangular grid graph is induced by all vertices with coordinates $1$ to $m$ and $1$ to $n$, respectively. A natural drawing of a (rectangular) grid graph $G$ is obtained by drawing its vertices in $\mathbb{R}^2$ according to their coordinates. We consider a subclass of the rectangular grid graphs obtained by deleting some vertices from the corners. Apart from the outer face, all (inner) faces of these graphs have area one (bounded by a 4-cycle) in a natural drawing of these graphs. We determine which of these graphs contain a Hamilton cycle, i.e. a cycle containing all vertices, and solve the problem of determining a spanning 2-connected subgraph with as few edges as possible for all these graphs.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente
Number of pages8
Publication statusPublished - 2002

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-05C40
  • IR-65817
  • EWI-3450
  • MSC-05C85
  • METIS-208264


Dive into the research topics of 'Spanning 2-connected subgraphs in truncated rectangular grid graphs'. Together they form a unique fingerprint.

Cite this