1. Enumeration of latin squares with application to order 8;Brown;J . Combin . Theor.,1968
2. Computational approaches to certain problems in the theory of finite groups;Butler,1979
3. Problems Polynomrially Equivalent to Graph Isomorphism;Booth,1979
4. The complexity of combinatorial isomorphism problems II;Colbourn;Proc. Ninth Manitoba Conf. on Numerical Math. and Computing,1979
5. A theoretical analysis of various heuristics for the graph isomorphism problem;Corneil;SIAM J. Comp.,1980