سند علمی

Bent Hamilton Cy les in d-Dimensional Grid Graphs

چکیده

F. Ruskey Joe Sawada y May 15, 2002 Abstra t A bent Hamilton y le in a grid graph is one in whi h ea h edge in a su essive pair of edges lies in a di erent dimension. We show that the d-dimensional grid graph has a bent Hamilton y le if some dimension is even and d 3, and does not have a bent Hamilton y le if all dimensions are odd. In the latter ase, we determine the onditions for when a bent Hamilton path exists. For the d-dimensional toroidal grid graph (i.e., the graph produ t of d y les), we show that there exists a bent Hamilton y le when all dimensions are odd and d 3. We also show that if d = 2, then there exists a bent Hamilton y le if and only if both dimensions are even.

اسناد مشابه

  • Bent Hamilton Cycles in d-Dimensional Grid Graphs

    سند علمی۲۰۰۳Electr. J. Comb.Frank Ruskey, Joe Sawada

    A bent Hamilton cycle in a grid graph is one in which each edge in a successive pair of edges lies in a different dimension. We show that the d-dimensional grid graph has a bent Hamilton cycle if some dimension is even and d ≥ 3, and does not have a bent Hamilton cycle if all dim

  • Hamilton Paths in Grid Graphs

    سند علمی۱۹۸۲SIAM J. Comput.Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter

    A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path betwe

  • Bent Hamilton Cycles in $d$-Dimensional Grid Graphs

    مقاله‌ی دسترسی آزاد۲۰۰۳The Electronic Journal of CombinatoricsF.Ruskey, JoeSawada
  • Hamiltonicity of Topological Grid Graphs

    سند علمی۲۰۰۷J. UCSChristina Zamfirescu, Tudor Zamfirescu

    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 o

  • Hamilton Paths in Grid Graphs

    مقاله‌ی دسترسی آزاد۱۹۸۲SIAM Journal on ComputingAlonItai, Christos H.Papadimitriou, Jayme LuizSzwarcfiter
  • On Hamilton paths in grid graphs

    مقاله‌ی دسترسی آزاد۲۰۱۳Advanced Studies in Theoretical PhysicsA.Gorbenko, V.Popov