1. Symmetric squares of graphs;Audenaert;J. Combin. Theory Ser. B,2007
2. Random graph isomorphism;Babai;SIAM J. Comput.,1980
3. An optimal lower bound on the number of variables for graph identification;Cai;Combinatorica,1992
4. Weisfeiler–Lehman refinement requires at least a linear number of iterations;Fürer,2001
5. M. Grohe, Equivalence in finite-variable logics is complete for polynomial time, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS, 1996, p. 264.