共 23 条
- [1] THE HAMILTON CIRCUIT PROBLEM ON GRIDS [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (06): : 567 - 582
- [2] Not being (super)thin or solid is hard: A study of grid Hamiltonicity [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (6-7): : 582 - 605
- [3] Chen SD, 2002, PARALLEL COMPUT, V28, P1293, DOI 10.1016/S0167-8191(02)00135-7
- [5] Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
- [6] Hamiltonian properties of triangular grid graphs [J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 6166 - 6188
- [7] Hou K, 2018, P 30 CAN C COMP GEOM, P114
- [9] The Hamiltonian properties of supergrid graphs [J]. THEORETICAL COMPUTER SCIENCE, 2015, 602 : 132 - 148
- [10] Icking C, 2005, LECT NOTES COMPUT SC, V3595, P524, DOI 10.1007/11533719_53