Coloring planar perfect graphs by decomposition (Q1093649)

From MaRDI portal
Revision as of 19:14, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Coloring planar perfect graphs by decomposition
scientific article

    Statements

    Coloring planar perfect graphs by decomposition (English)
    0 references
    0 references
    1986
    0 references
    This paper describes a decomposition scheme for colouring perfect graphs, so that it suffices to colour perfect graphs which are well connected. This approach yields a new good colouring algorithm for perfect planar graphs, and it seems that the approach goes further.
    0 references
    0 references
    decomposition scheme
    0 references
    colouring perfect graphs
    0 references
    colouring algorithm
    0 references
    perfect planar graphs
    0 references

    Identifiers