2000 character limit reached
Hamiltonian Paths in C-shaped Grid Graphs
Published 24 Feb 2016 in cs.CC | (1602.07407v1)
Abstract: We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for finding a Hamiltonian path between two given vertices of a C-shaped grid graph, if it exists.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.