Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced minor free graphs: isomorphism and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width for Graph Classes Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the clique-width of \(H\)-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding clique-width via perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and well-quasi-ordering of triangle-free graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved isomorphism test for bounded-tree-width graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism for graph classes characterized by two forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism for unit square graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for classes of graphs closed under contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an isomorphism dichotomy for hereditary graph classes / rank
 
Normal rank

Revision as of 22:21, 24 July 2024

scientific article
Language Label Description Also known as
English
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
scientific article

    Statements

    Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 April 2021
    0 references
    hereditary graph class
    0 references
    induced subgraph
    0 references
    clique-width
    0 references
    graph isomorphism
    0 references
    0 references
    0 references

    Identifiers