1. A. Soifer, The Mathematical Coloring Book. Mathematics of Coloring and the Colorful Life of its Creators (Springer, New York, 2009).
2. N. G. de Bruijn and P. Erdos, “A colour problem for infinite graphs and a problem in the theory of relations,” Indag. Math. 13, 369–373 (1951).
3. M. Tikhomirov, “On computational complexity of length embeddability of graphs,” Discrete Math. 339 (11), 2605–2612 (2016).
4. Lecture Notes in Comput. Sci.;B. Horvat,2011
5. M. Tikhomirov, “On complexity of multidistance graph recognition in $$\mathbb{R}^1$$,” Elect. Notes Discr. Math. 61, 1039–1045 (2017).