1. Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of a simple polygon is NP-complete. Discrete Comput. Geom. 54(2), 368–389 (2015). https://doi.org/10.1007/s00454-015-9709-7
2. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2011)
3. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: 37th Conference on Foundations of Computer Science, pp. 2–11 (1996)
4. Lecture Notes in Computer Science;S Bereg,2008
5. Bereg, S., Ito, H.: Transforming graphs with the same graphic sequence. J. Inf. Process. 25, 627–633 (2017)