Isomorphism Testing and Symmetry of Graphs

This publication has 17 references indexed in Scilit:

• On the Complexity of Canonical Labeling of Strongly Regular Graphs
  SIAM Journal on Computing, 1980
• A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
  Published by Association for Computing Machinery (ACM) ,1980
• Isomorphism testing for graphs of bounded genus
  Published by Association for Computing Machinery (ACM) ,1980
• Canonical labelling of graphs in linear average time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• A note on the graph isomorphism counting problem
  Information Processing Letters, 1979
• Computing automorphisms and canonical labellings of graphs
  Lecture Notes in Mathematics, 1978
• Reducibility, randomness, and intractibility (Abstract)
  Published by Association for Computing Machinery (ACM) ,1977
• SYMMETRIC HADAMARD MATRICES OF ORDER 36
  Annals of the New York Academy of Sciences, 1970
• On full embeddings of categories of algebras
  Illinois Journal of Mathematics, 1966
• Lattices With a Given Abstract Group of Automorphisms
  Canadian Journal of Mathematics, 1950