1. Arvind, V., Köbler, J., Rattan, G., Verbitsky, O.: Graph isomorphism, color refinement, and compactness. Comput. Complex. 26(3), 627–685 (2017)
2. Babai, L.: Group, graphs, algorithms: the graph isomorphism problem. In: Proceedings of the International Congress of Mathematicians—Rio de Janeiro. Vol. IV. Invited lectures, pp. 3319–3336. World Sci. Publ., Hackensack, NJ (2018)
3. Conference in Algebraic Graph Theory, Symmetry vs Regularity. The first 50 years since Weisfeiler–Leman stabilization, July 1–7, Pilsen, Czech Republic. https://www.iti.zcu.cz/wl2018/index.html (2008)
4. Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory Ser. B 41(2), 182–208 (1986)
5. Cai, J.-Y., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389–410 (1992)