Two complexity results for the vertex coloring problem (Q505438)

From MaRDI portal
Revision as of 08:30, 13 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
Two complexity results for the vertex coloring problem
scientific article

    Statements

    Two complexity results for the vertex coloring problem (English)
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    computational complexity
    0 references
    coloring problem
    0 references
    hereditary class
    0 references
    polynomial-time algorithm
    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