1. Algorithmic Investigations in Combinatorics [in Russian], Nauka, Moscow (1978).
2. V. L. Arlazarov, I. I. Zuev, A. V. Uskov, and I. A. Faradzhev, “Algorithms for bringing finite undirected graphs to canonic form,” Zh. Vychisl. Mat. Mat. Fiz.,14, No. 3, 737–743 (1974).
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addition-Wesley, Reading, MA (1974).
4. B. Yu. Veisfeiler and A. A. Leman, “Reducing a graph to canonic form and the algebra arising here,” Nauchn.-Tekh. Inf., Ser. 2, No. 9, 12–16 (1968).
5. G. G. Vizing, “Reduction of the problems of isomorphism and of the isomorphic imbedding of graphs to the problem of finding the incompleteness of a graph,” All-Union Conf. Cybernetics Problems [in Russian], Novosibirsk (1974), pp. 124–125.