The Hamiltonian properties of supergrid graphs

In this paper, we first introduce a novel class of graphs, namely supergrid. Supergrid graphs include grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for grid graphs and triangular grid graphs were known to be NP-complete. However, they are unknown for supergrid graphs. The Hamiltonian cycle (path) problem on supergrid graphs can be applied to control the stitching traces of computerized sewing machines. In this paper, we will prove that the Hamiltonian cycle problem for supergrid graphs is NP-complete. It is easily derived from the Hamiltonian cycle result that the Hamiltonian path problem on supergrid graphs is also NP-complete. We then show that two subclasses of supergrid graphs, including rectangular (parallelism) and alphabet, always contain Hamiltonian cycles.

[1]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[2]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[3]  T. Zamfirescu,et al.  Intersections of longest cycles in grid graphs , 1997 .

[4]  Total complementary tree domination in grid graphs , 2013, SOCO 2013.

[5]  Frank Werner,et al.  Hamiltonian properties of triangular grid graphs , 2008, Discret. Math..

[6]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[7]  Sun-Yuan Hsieh,et al.  Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults , 2010, J. Comb. Optim..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Yong-Jin Liu,et al.  Approximating the longest paths in grid graphs , 2011, Theor. Comput. Sci..

[10]  Isma Bouchemakh,et al.  On the Broadcast Independence Number of Grid Graph , 2014, Graphs Comb..

[11]  Alan A. Bertossi,et al.  Hamiltonian Circuits in Interval Graph Generalizations , 1986, Inf. Process. Lett..

[12]  Christina Zamfirescu,et al.  Hamiltonian Properties of Grid Graphs , 1992, SIAM J. Discret. Math..

[13]  John R. Reay,et al.  Hamiltonian Cycles in T-Graphs , 2000, Discret. Comput. Geom..

[14]  Christopher Umans,et al.  Hamiltonian cycles in solid grid graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[15]  Alireza Bagheri,et al.  Hamiltonian Paths in Some Classes of Grid Graphs , 2012, J. Appl. Math..

[16]  M. S. Krishnamoorthy,et al.  An NP-hard problem in bipartite graphs , 1975, SIGA.

[17]  Sun-Yuan Hsieh,et al.  Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs , 2013, IEEE Transactions on Parallel and Distributed Systems.

[18]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[19]  Henk Meijer,et al.  Hamilton Circuits in Hexagonal Grid Graphs , 2007, CCCG.

[20]  Sun-Yuan Hsieh,et al.  Conditional edge-fault Hamiltonicity of augmented cubes , 2010, Inf. Sci..

[21]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1985, J. Algorithms.

[22]  Dániel Marx.  Eulerian disjoint paths problem in grid graphs is NP-complete , 2004, Discret. Appl. Math..

[23]  Peter Damaschke,et al.  The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete , 1989, Inf. Process. Lett..

[24]  Sun-Yuan Hsieh,et al.  Hamiltonicity of Product Networks with Faulty Elements , 2014, IEEE Transactions on Parallel and Distributed Systems.

[25]  Sylvain Gravier,et al.  Total domination number of grid graphs , 2002, Discret. Appl. Math..

[26]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[27]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[28]  Magdalena Lemanska,et al.  Bondage number of grid graphs , 2012, Discret. Appl. Math..

[29]  John F. O'Callaghan,et al.  Computing the perceptual boundaries of dot patterns , 1974, Comput. Graph. Image Process..

[30]  Asghar Asgharian-Sardroud,et al.  A linear-time algorithm for the longest path problem in rectangular grid graphs , 2012, Discret. Appl. Math..

[31]  Hong Shen,et al.  An efficient algorithm for constructing Hamiltonian paths in meshes , 2002, Parallel Comput..

[32]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[33]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[34]  Jun-Ming Xu,et al.  The total bondage number of grid graphs , 2011, Discret. Appl. Math..

[35]  M. Salman.  Contributions to graph theory , 2005 .

[36]  Vladimir Grebinski,et al.  Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping , 1998, Discret. Appl. Math..