1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR abs/2107.10689 (2021)
3. Ağaoğlu, D., Hliněný, P.: Isomorphism problem for $$S_d$$-graphs. In: MFCS 2020. LIPIcs, vol. 170, pp. 4:1–4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
4. Ağaoğlu, D., Hliněný, P.: Isomorphism testing for T-graphs in FPT. CoRR abs/2111.10910 (2021)
5. Ağaoğlu, D., Hliněný, P.: Efficient isomorphism for $$S_d$$-graphs and $$T$$-graphs. CoRR abs/1907.01495 (2021)