Graph isomorphism for (H₁, H₂)-free graphs: an almost complete dichotomy
From MaRDI portal
Publication:2661991
Recommendations
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
- On subgraph complementation to \(H\)-free graphs
- On subgraph complementation to \(H\)-free Graphs
- On Switching to H‐Free Graphs
- On Switching to H-Free Graphs
- scientific article; zbMATH DE number 475587
- Isomorphism of two infinite-chromatic triangle-free graphs
- On hypohamiltonian and almost hypohamiltonian graphs
- Logical Approaches to Computational Barriers
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Cites work
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- An improved isomorphism test for bounded-tree-width graphs
- Bounding clique-width via perfect graphs
- Bounding the Clique‐Width of H‐Free Chordal Graphs
- Bounding the clique-width of \(H\)-free split graphs
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-width for graph classes closed under complementation
- Clique-width for hereditary graph classes
- Colouring diamond-free graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Graph isomorphism for unit square graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism is in the low hierarchy
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On testing isomorphism of permutation graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Paw-free graphs
- Recent developments on graphs of bounded clique-width
- The isomorphism problem for classes of graphs closed under contraction
- Towards an isomorphism dichotomy for hereditary graph classes
Cited in
(12)- Tree pivot-minors and linear rank-width
- Clique‐width: Harnessing the power of atoms
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- A class of graphs with large rankwidth
- On Switching to H-Free Graphs
- Graph Isomorphism for (H₁,H₂)-free Graphs: An Almost Complete Dichotomy
- Logical Approaches to Computational Barriers
- Towards an isomorphism dichotomy for hereditary graph classes
- Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes
- On Switching to H‐Free Graphs
- On subgraph complementation to \(H\)-free Graphs
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
This page was built for publication: Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661991)
