1. Fermat de P., Tannery, H. (eds.): OeuPres, vol. 1, Paris 1891, Supplement: Paris 1922, p. 153 (1643)
2. Chanderjit B.: Limitations To Algorithm Solvability: Galois Methods and Models of Computation, Computer Science Technical Reports, Paper 486 (1986) http://docs.lib.purdue.edu/cstech/486
3. Harary, F.: Graph Theory. Addison-Wesley, MA (1969)
4. Ivanov, A.O., Tuzhilin, A.A.: Minimal Spanning Trees on Infinite Sets. Fund. i Prikl. Matem. 20(2), 89–103 (2015). (in Russian, English translation to appear in J. of Math. Sci., 2016)
5. Ivanov, A.O., Nikonov, I.M., Tuzhilin, A.A.: Sets admitting connection by graphs of finite length. Matem. Sbornik 196(6), 71–110 (2005). (Sbornik: Math., 196 (6), pp. 845–884)