1. A. Aho, J. Hoperoft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Toronto, 1974.
2. L. Babai, P. Erdös, S.M. Selkow, Random graph isomorphism, SIAM J. of Computing 9 (1980), 628–635.
3. Laszlo Babai and Eugene Luks, Canonical labeling of graphs,Proc. 15th Annual ACM Symp. on Theory of Computing, SIGACT, 1983.
4. J.M. Bennett and J.J. Edwards, A graph isomorphism algorithm using pseudoinverses, preprint, Computer Science Department, University of Sydney.
5. N.L. Biggs and A.T. White, Permutation Groups and Combinatorial Structures, London Math. Soc. Lecture Notes #33, Cambridge Univ. Press, Cambridge, 1979.