Abstract
In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube and polymino. A Spanning closed trail is an eulerian subgraph containing all vertices of a given graph. For general grid graphs we prove that the problem of finding that trail is N P-complete and for a wide subclass of grid graphs, called polymino, we give an an optimal algorithm if it exists. For polycube graphs we prove that every polycube has a spanning closed trail. Finally we show that a graph product G to a simple path with length n, G × P n, is hamiltonian for all n≥2, if G is a polymino with a perfect matching.
Parts of this work were done while authors visited in Max-Planck-Institut für Informatik, Saarbrücken, Germany.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. A. Catlin, A reduction method to Find Spanning Eulerian Subgraphs, J. Graph theory, Vol.12, No. 1, pp. 29–44, 1988.
P. A. Catlin, Spanning trails, J. Graph Theory, vol.11, No.2, pp.161–167, 1987.
P. A. Catlin, Spanning Eulerian subgraphs and matching, Discrete Math., 76, pp. 95–116, 1989
Z. H. Chen, Spanning closed trails in graphs. Discrete Math. 117, pp. 57–71, 1993.
F. Harary, Graph Theory, Addison-Wesley Pub., 1972.
A. Itai, C. H. Papadimitriou and J.L. Szwarcfiter, Hamiltonian Paths in Grid Graphs., SIAM, Comp., Vol., 11, No.4, Nov., pp.676–686, 1982.
M. Kaufmann and K. Mehlhorn, A linear-time algorithm for the Homotopic routing in grid graph SIAM J. Comput. vol. 23, No. 2. pp. 227–246, Apr. 1994.
T. H. Lai and L. S. Wei, The edge hamiltonian path problem is NP-complete for bipartite graphs Infom. Process. Lett., 46, pp. 21–26, 1993.
C.H. Papadimitriou and U.V. Vazirani, On two geometric problems related to the traveling salesman problem, J. of Algorithms, vol.5, pp.231–246, 1984.
F. S. Roberts, Graph Theory and Its applications to Problems of Society, CBMSNSF Regional Conference Series in Applied Mathematics, Vol. 29, SIAM, 3rd, pr. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, HG., Zelikovsky, A. (1995). Spanning closed trail and hamiltonian cycle in grid graphs. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015440
Download citation
DOI: https://doi.org/10.1007/BFb0015440
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive