Complexity of choosing subsets from color sets (Q1584428)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of choosing subsets from color sets |
scientific article; zbMATH DE number 1525002
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of choosing subsets from color sets |
scientific article; zbMATH DE number 1525002 |
Statements
Complexity of choosing subsets from color sets (English)
0 references
2 November 2000
0 references
list coloring
0 references
choosability
0 references
satisfiability
0 references
algorithmic complexity
0 references
Turán problem
0 references
hypergraphs
0 references
