New hardness results for graph and hypergraph colorings (Q5368748)
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: New hardness results for graph and hypergraph colorings |
scientific article; zbMATH DE number 6789279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8596577048301697
0 references
0.8472323417663574
0 references
0.8459286093711853
0 references
0.8389138579368591
0 references
0.8373167514801025
0 references
