Published November 28, 2007 | Version v1

Hamiltonicity of Topological Grid Graphs

  • 1. City University of New York, New York, United States of America
  • 2. Universität Dortmund, Dortmund, Germany

Description

In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.

Files

jucs_article_28902.pdf

Files (123.1 kB)

Name Size
md5:e819d34dc430705b7bd23bc4016af1b2
123.1 kB Preview Download