Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
From MaRDI portal
Publication:2661991
DOI10.1007/s00453-020-00747-xOpenAlexW3048268335MaRDI QIDQ2661991
Nicolas Bousquet, Théo Pierron, Daniël Paulusma, Konrad K. Dabrowski, Matthew Johnson, Marthe Bonamy
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.12252
Related Items
Clique‐width: Harnessing the power of atoms, A class of graphs with large rankwidth, Tree Pivot-Minors and Linear Rank-Width
Cites Work
- Unnamed Item
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Recent developments on graphs of bounded clique-width
- Paw-free graphs
- Graph isomorphism is in the low hierarchy
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- The isomorphism problem for classes of graphs closed under contraction
- Towards an isomorphism dichotomy for hereditary graph classes
- Induced minor free graphs: isomorphism and clique-width
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
- Colouring diamond-free graphs
- Bounding clique-width via perfect graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- On testing isomorphism of permutation graphs
- Graph Isomorphism for unit square graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- An improved isomorphism test for bounded-tree-width graphs
- Clique-Width for Graph Classes Closed under Complementation
- Clique-width for hereditary graph classes
- Bounding the Clique‐Width of H‐Free Chordal Graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Bounding the clique-width of \(H\)-free split graphs
