New hardness results for graph and hypergraph colorings (Q5368748)
From MaRDI portal
scientific article; zbMATH DE number 6789279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New hardness results for graph and hypergraph colorings |
scientific article; zbMATH DE number 6789279 |
Statements
10 October 2017
0 references
hardness of approximation
0 references
graph coloring
0 references
hypergraph coloring
0 references
polymorphisms
0 references
combinatorics
0 references
New hardness results for graph and hypergraph colorings (English)
0 references
