Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344)

From MaRDI portal
Revision as of 03:03, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
scientific article

    Statements

    Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    clique separator decomposition
    0 references
    hole-free and diamond-free graphs
    0 references
    hole-free and paraglider-free graphs
    0 references
    perfect graphs
    0 references
    efficient algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers