On algorithms for (\(P_5\), gem)-free graphs (Q817767)

From MaRDI portal
Revision as of 17:09, 25 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567840, #quickstatements; #temporary_batch_1719331587082)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On algorithms for (\(P_5\), gem)-free graphs
scientific article

    Statements

    On algorithms for (\(P_5\), gem)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    (\(P_{5}\), gem)-free graphs
    0 references
    recognition algorithms
    0 references
    modular decomposition
    0 references
    independent set
    0 references
    clique
    0 references
    coloring
    0 references
    clique cover
    0 references
    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
    0 references