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

From MaRDI portal
Revision as of 20:49, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    0 references
    0 references
    0 references
    0 references
    0 references