1. Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of STOC 2016, pp. 684–697 (2016)
2. Belmonte, R., Otachi, Y., Schweitzer, P.: Induced minor free graphs: isomorphism and clique-width. Algorithmica 80(1), 29–47 (2018)
3. Blanché, A., Dabrowski, K.K., Johnson, M., Lozin, V.V., Paulusma, D., Zamaraev, V.: Clique-width for graph classes closed under complementation. In: Proceedings of MFCS 2017. LIPIcs, vol. 83, pp. 73:1–73:14 (2017)
4. Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical report CS-77-04, Department of Computer Science, University of Waterloo (1979)
5. Brandstädt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of
$$H$$
H
-free split graphs. Discrete Appl. Math. 211, 30–39 (2016)