An \(O(n^2)\) algorithm to color Meyniel graphs (Q5937923)

From MaRDI portal
Revision as of 22:40, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dm/RousselR01, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1621232
Language Label Description Also known as
English
An \(O(n^2)\) algorithm to color Meyniel graphs
scientific article; zbMATH DE number 1621232

    Statements

    An \(O(n^2)\) algorithm to color Meyniel graphs (English)
    0 references
    0 references
    0 references
    23 October 2001
    0 references
    perfect graphs
    0 references
    Meyniel graphs
    0 references
    coloring
    0 references
    greedy algorithm
    0 references

    Identifiers