Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7649
Title: More on Spanning 2-Connected Subgraphs of Alphabet Graphs, Special Classes of Grid Graphs
Authors: A.N.M. Salman
H.J. Broersma
Issue Date: 2005
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
Abstract: A grid graph G is a finite induced subgraph of the infinite 2- dimensional grid defined by Z x Z and all edges between pairs of vertices from Z x Z at Euclidean distance precisely 1. A natural drawing of G is obtained by drawing its vertices in R2 according to their coordinates. Apart from the outer face, all (inner) faces with area exceeding one (not bounded by a 4-cycle) in a natural drawing of G are called the holes of G. We define 26 classes of grid graphs called alphabet graphs, with no or a few holes. We determine which of the alphabet 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 alphabet graphs.
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7649
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
More on Spanning 2-Connected Subgraphs.pdf
  Restricted Access
3.92 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.