Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy

@article{Bonamy2019GraphIF,
  title={Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy},
  author={Marthe Bonamy and Konrad K. Dabrowski and M. Johnson and D. Paulusma},
  journal={ArXiv},
  year={2019},
  volume={abs/1811.12252}
}
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)$. Schweitzer had previously shown that the number of open cases was finite, but without specifying the open cases. Grohe and Schweitzer proved that Graph Isomorphism is polynomial-time solvable on graph classes of bounded clique-width. Our work combines known results such as these with new results. By exploiting a… Expand
5 Citations
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy
  • 1
  • PDF
Clique-Width: Harnessing the Power of Atoms
  • PDF
Clique-Width for Hereditary Graph Classes
  • 15
  • PDF
Clique-width and well-quasi-ordering of triangle-free graph classes
  • 1

References

SHOWING 1-10 OF 43 REFERENCES
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy
  • 1
  • PDF
Induced Minor Free Graphs: Isomorphism and Clique-Width
  • 9
  • PDF
Bounding the clique-width of H-free split graphs
  • 23
  • PDF
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
  • 32
  • PDF
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
  • 11
Bounding Clique-Width via Perfect Graphs
  • 22
  • PDF
Bounding the Clique-Width of H-free Chordal Graphs
  • 19
  • PDF
Bounding the Clique-Width of H-Free Chordal Graphs
  • 14
Clique-Width for Hereditary Graph Classes
  • 15
  • PDF
...
1
2
3
4
5
...