Finding the Hamiltonian cycles in graphs is a well-known problem.Although, Hamiltonicity of grid graphs has been studied in the literature, there are few results on Hamiltonicity of grid graphs that have holes.In this paper, we study Hamiltonicity of rectangular grid graphs (meshes) with an Lshaped hole, and give a linear-time algorithm.The holes in meshes correspond to the faulty nodes.
No takes yet. Share an insight, caveat, or question.
Rouhani-Marchoobeh et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: