The Hamiltonian $(s,t)$-path problem in odd-sized $H$-alphabet grid graphs

[1] T .W. Chang, O. Navrtil, S. L. Peng, The end-to-end longest path problem on a mesh with a missing vertex, Front. Artif. Intell. Appl., 274 (2015) 59–66.
[2] S. D. Chen, H. Shen and R. Topor, An efficient algorithm for constructing Hamiltonian paths in meshe, Parallel Comput., 28 no. 9 (2002) 1293–1305.
[3] M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences, W. H. Freeman and Co., San Francisco, CA, 1979.
[4] K. Hamada, A picturesque maze generation algorithm with any given endpoints, Journal of Information Processing, 21 no. 3 (2013) 393–397.

[5] C. Icking, T. Kamphans, R. Klein and E. Langetepe, Exploring simple grid polygons, Computing and combinatorics,
COCOON 2005, Lecture Notes in Comput. Sci., 3595, Springer, Berlin, 2005 524–533.
[6] A. Itai, C. H. Papadimitriou and J. L. Szwarcfiter, Hamiltonian paths in grid graphs, SIAM J. Comput., 11 no. 4 (1982)
676–686.
[7] F. Keshavarz-Kohjerdi and A. Bagheri, Hamiltonian paths in L-shaped grid graphs, Theoret. Comput. Sci., 621 (2016) 37–56.
[8] F. Keshavarz-Kohjerdi and A. Bagheri, Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time, Appl. Math. Comput., 436 (2023) 14 pp.
[9] F. Keshavarz-Kohjerdi, and A. Bagheri, Hamiltonian (s, t)-paths in solid supergrid graphs, Comput. Appl. Math., 43 no. 3 (2024) 24 pp.
[10] M. Kreh, A note on Hamiltonian cycles in planar graphs, Discrete Math. Algorithms Appl., 15 no. 1 (2023) 5 pp.
[11] R. I. Nishat, V. Srinivasan and S. Whitesides, 1-complex s, t Hamiltonian paths: structure and reconfiguration in rectangular grids, J. Graph Algorithms Appl., 27 no. 4 (2023) 281–327.
[12] R. I. Nishat, V. Srinivasan and S. Whitesides, Reconfiguring simple s,t Hamiltonian paths in rectangular grid graphs, Combinatorial Algorithms. IWOCA 2021, Lecture Notes in Comput. Sci., Springer, Cham, (2021) 501–515.
[13] R. I. Nishat, V. Srinivasan and S. Whitesides, The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs, J. Comb. Optim., 48 no. 31 (2024) 48 pp.
[14] R. I. Nishat and S. Whitesides, Reconfiguring Hamiltonian cycles in L-shaped grid graphs, Graph-theoretic concepts in computer science, WG 2019., Lecture Notes in Comput. Sci., Springer, Cham, (2019) 325–337.
[15] R. I. Nishat and S. Whitesides, Reconfiguration of Hamiltonian cycles in rectangular grid graphs, Internat. J. Found. Comput. Sci., 34 no. 07 (2023) 773–793.
[16] M. S. Rahman and M. Kaykobad, On Hamiltonian cycles and Hamiltonian paths, Inform. Process. Lett., 94 no. 1 (2005) 37–41.
[17] A. N. M. Salman, E. T. Baskoro and H. J. Broersma, A note concerning Hamiltonian cycles in some classes of grid graphs, J. Math. Fund. Sci., 35 no. 1 (2003) 65–70.
[18] B. Seluk and A. N. A. Tankl, Hamiltonian path, routing, broadcasting algorithms for connected square network graphs, Int. J. Eng. Sci. Technol., 44 (2023).
[19] C. Umans and W. Lenhart, Hamiltonian cycles in solid grid graphs, Proceedings of 38th Annual Symposium on Foundations of Computer Science, FOCS?, Miami Beach, FL, USA, (1997) 496–505.
[20] Y. Xie, On Hamiltonian properties of grid graph, International Conference on Intelligent Computing, Automation and Applications (ICAA), (2021) 5–9.
[21] J. M. Xu and M. Ma, Survey on path and cycle embedding in some networks, Front. Math. China, 4 no. 2 (2009) 217–252.