Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs

@inproceedings{HwanGue1995SpanningCT,
  title={Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs},
  author={Cho Hwan-Gue and Alex Zelikovsky},
  booktitle={ISAAC},
  year={1995}
}
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 nding that trail is NP-complete and for a wide subclass of grid graphs, called polymino, we give 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… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Graph Theory and Its applications to Problems of Society, CBMS NSF Regional Conference Series in Applied Mathematics, Vol. 29, SIAM, 3rd, pr

F. S. Roberts
1993
View 1 Excerpt

Spanning closed trails in graphs

Discrete Mathematics • 1993
View 2 Excerpts

Spanning eulerian subgraphs and matchings

Discrete Mathematics • 1989
View 1 Excerpt

A reduction method to find spanning Eulerian subgraphs

Journal of Graph Theory • 1988
View 1 Excerpt

Spanning trails

Journal of Graph Theory • 1987
View 1 Excerpt

Similar Papers

Loading similar papers…