Towards an isomorphism dichotomy for hereditary graph classes (Q1693994): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-017-9775-8 / rank
Normal rank
 
Property / cites work
 
Property / cites work: COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring of graphs with Ramsey-type forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonfactorial algorithm for testing isomorphism of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring in the absence of two subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4366883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict Propagation and Component Recursion for Canonical Labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Invariants to Canonization in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / 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: Graph isomorphism for graph classes characterized by two forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidability result for the dominating set problem / 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: Q3670594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Isomorphism Dichotomy for Hereditary Graph Classes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-017-9775-8 / rank
 
Normal rank

Latest revision as of 04:10, 11 December 2024

scientific article
Language Label Description Also known as
English
Towards an isomorphism dichotomy for hereditary graph classes
scientific article

    Statements

    Towards an isomorphism dichotomy for hereditary graph classes (English)
    0 references
    0 references
    1 February 2018
    0 references
    graph isomorphism
    0 references
    modular decomposition
    0 references
    bounded color valence
    0 references
    reductions
    0 references
    forbidden induced subgraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references