Refinement-Derived Algebraic Computation of Graph Automorphism Groups
We compute the automorphism group of a graph exactly, with a verified generatingset. Inside each class of an invariant colouring, individualisation and refinement yielda permutation group TC that contains the restriction of every automorphism; a normalseries of these groups turns the edges between classes into affine s...