Publisher
Springer Science and Business Media LLC
Reference30 articles.
1. Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Nunez-Rodriguez, Y., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super)thin or solid is hard: a study of grid Hamiltonicity. Comput. Geom. 42(6–7), 582–605 (2009)
2. Bondy, J., Murty, U.: Graph Theory with Applications. Elsevier, New York (1976)
3. Chen, S.D., Shen, H., Topor, R.: An efficient algorithm for constructing Hamiltonian paths in meshes. Parallel Comput. 28, 1293–1305 (2002)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)
5. Gordon, V.S., Orlovich, Y.L., Werner, F.: Hamiltonian properties of triangular grid graphs. Discret. Math. 308(24), 6166–6188 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hamiltonian (s, t)-paths in solid supergrid graphs;Computational and Applied Mathematics;2024-03-10