Hamiltonian paths in some classes of grid graphs

DOI10.1155/2012/475087zbMATH Open1245.05081arXiv1107.1780OpenAlexW2023050191WikidataQ58905946 ScholiaQ58905946MaRDI QIDQ442933FDOQ442933

Authors: Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri 

Publication date: 6 August 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Abstract: In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in $L-$alphabet and $C-$alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.

Full work available at URL: https://arxiv.org/abs/1107.1780

Recommendations

• Hamiltonian paths in \(L\)-shaped grid graphs
• Hamiltonian Properties of Grid Graphs
• scientific article; zbMATH DE number 4031743
• scientific article; zbMATH DE number 4091550
• Hamiltonian paths and hamiltonian connectivity in graphs
• Hamiltonian Paths and Cycles in Planar Graphs
• Hamilton paths in graphs whose vertices are graphs
• Hamiltonian paths in Cayley graphs
• Hamiltonian paths in distance graphs

zbMATH Keywords

linear-time algorithms\(C\)-alphabet,\(E\)-alphabet\(F\)-alphabet\(L\)-alphabet

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Hamilton Paths in Grid Graphs
• A linear-time algorithm for the longest path problem in rectangular grid graphs
• An efficient algorithm for constructing Hamiltonian paths in meshes
• Hamiltonian Properties of Grid Graphs
• Hamiltonian paths in some classes of grid graphs
• Hamiltonian properties of triangular grid graphs
• Advances on the Hamiltonian problem -- a survey
• Expected Computation Time for Hamiltonian Path problem
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• On Hamiltonian cycles and Hamiltonian paths
• Paths in interval graphs and circular arc graphs
• A theorem of Littlewood, Orlicz, and Grothendieck about sums in \(L^1(0,1)\)
• The domination numbers of cylindrical grid graphs

Cited In (27)

• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Some new characterizations of Hamiltonian cycles in triangular grid graphs
• Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
• Cardinality constrained path covering problems in grid graphs
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole
• Bend complexity and Hamiltonian cycles in grid graphs
• The Hamiltonian connectivity of rectangular supergrid graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
• Longest (s, t)-paths in L-shaped grid graphs
• A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian paths in \(L\)-shaped grid graphs
• Hamiltonian cycles in linear-convex supergrid graphs
• The Hamilton circuit problem on grids
• Hamiltonian paths in some classes of grid graphs
• The Hamiltonian properties of supergrid graphs
• Spanning closed trail and hamiltonian cycle in grid graphs
• Hamiltonian properties of triangular grid graphs
• Hamiltonian (s, t)-paths in solid supergrid graphs
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• 2-Trees: Structural insights and the study of Hamiltonian paths

This page was built for publication: Hamiltonian paths in some classes of grid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442933)