[1]
Russell, A. and Sundaram, R. 1998. A Note on the Asymptotics and Computational Complexity of Graph Distinguishability. The Electronic Journal of Combinatorics. 5, 1 (Mar. 1998), R23. DOI:https://doi.org/10.37236/1361.