1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley, 1974.
2. Babai, L., Grigor'ev, D. Y., Mount, D. M.: Isomorphism of graphs with bounded eigenvalue multiplicity, In: Proc. 14th ACM Symposium on Theory of Computing 1982, pp. 310–324.
3. Babel, L., Olariu, S.: Isomorphism of graphs with fewP 4s (1994) [submitted].
4. Lecture Notes in Computer Science;L. Babel,1994
5. Booth, K. S., Colbourn, C. J.: Problems polynomially equivalent to graph isomorphism, Report No. CS-77-04. Computer Science Department, University of Waterloo 1979.