Abstract:
|
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the Hamiltonian paths in Gn,m, where two vertices P1 and P2 are adjacent if we can obtain P2 from P1 by deleting an edge in P1 and adding an edge not in P1. In this paper we show that Hn,2, Hn,3 and Hn,4 are connected |