1. R.E.L. Aldred, M.N. Ellingham, R.L. Hemminger, P. Jipsen, P3-isomorphisms for graphs. J. Graph Theory 26(1), 35–51 (1997)
2. A. Atserias, E. Maneva, Graph isomorphism, Sherali-Adams relaxations and expressibility in counting logics, in Electronic Colloquium on Computational Complexity, vol. 77 (2011), pp. 1–34
3. L. Babel, Recognition and isomorphism of tree-like P4-connected graphs. Discrete Appl. Math. 99(1–3), 295–315 (2000)
4. A. Dharwadker, J. T. Tevet, The graph isomorphism algorithm, in Proceedings of the structure semiotics research group s.e.r.r. eurouniversity, TALLINN (2009), pp. 1–30
5. E. Dobson, I. Kovacs, S. Miklavic, The isomorphism problem for window graphs. Discrete Math. 323, 7–13 (2014)