Permutation Groups and the Graph Isomorphism Problem - Perspectives in Computational Complexity - page 196

[Luk82] E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial
time. J. Comput. Syst. Sci. 25 (1), 42-65 (1982)
[Luk86] E.M. Luks, Parallel algorithms for permutation groups and graph isomorphism, in
Proceedings of the IEEE Foundations of Computer Science, IEEE Computer Society
(1986), pp. 292-302
[Luk93] E.M. Luks, Permutation groups and polynomial time computations. DIMACS Ser.
Discrete Math. Theoret. Comput. Sci. 11 , 139-175 (1993)
[Mat79] R. Mathon, A note on graph isomorphism counting problem. Inf. Process. Lett. 8 (3),
131-132 (1979)
[Pál82] P.P. Pálfy, A polynomial bound for the orders of primitive solvable groups. J. Algebra
77 , 127-137 (1982)
[Sch87] U. Schöning, Graph isomorphism is in the low hierarchy. in Symposiumon Theoretical
Aspects of Computer, Science (1987), pp. 114-124
[Sim67] C.C. Sims, Graphs and finite permutation groups. Mathematische Zeitschrift 95 , 76-86
(1967)
[Sim78] C.C. Sims, Some group theoretic algorithms. Top. Algebra 697, 108-124 (1978)
[Tor04] J. Torán, On the hardness of graph isomorphism. SIAM J. Comput. 33(5),
1093-1108 (2004)
[Wie64] H. Wielandt, Finite Permutation Groups (Academic Press, New York, 1964)
[ZKT85] V.N. Zemlyachenko, N.M. Korneenko, R.I. Tyshkevich, Graph isomorphism problem.
J. Sov. Math. 29 , 1426-1481 (1985)