Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy

Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski +3

We resolve the computational complexity of Graph Isomorphism for classes of graphs characterized by two forbidden induced subgraphs $H_1$ and $H_2$ for all but six pairs $(H_1,H_2)…