Hamiltonian paths in some classes of grid graphs
From MaRDI portal
Publication:442933
DOI10.1155/2012/475087zbMath1245.05081arXiv1107.1780OpenAlexW2023050191WikidataQ58905946 ScholiaQ58905946MaRDI QIDQ442933
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Publication date: 6 August 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1780
Related Items
Hamiltonian cycles in linear-convex supergrid graphs ⋮ Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Hamiltonian paths in some classes of grid graphs ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ The Hamiltonian properties of supergrid graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
Cites Work
- Unnamed Item
- Hamiltonian paths in some classes of grid graphs
- The domination numbers of cylindrical grid graphs
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- Hamiltonian properties of triangular grid graphs
- On Hamiltonian cycles and Hamiltonian paths
- Paths in interval graphs and circular arc graphs
- Advances on the Hamiltonian problem -- a survey
- A theorem of Littlewood, Orlicz, and Grothendieck about sums in \(L^1(0,1)\)
- An efficient algorithm for constructing Hamiltonian paths in meshes
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Expected Computation Time for Hamiltonian Path problem
- Hamiltonian Properties of Grid Graphs
- Hamilton Paths in Grid Graphs
