Complexity of choosing subsets from color sets (Q1584428)

From MaRDI portal
Revision as of 11:51, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of choosing subsets from color sets
scientific article

    Statements

    Complexity of choosing subsets from color sets (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    list coloring
    0 references
    choosability
    0 references
    satisfiability
    0 references
    algorithmic complexity
    0 references
    Turán problem
    0 references
    hypergraphs
    0 references
    0 references