A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652)
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: A Complexity Dichotomy for the Coloring of Sparse Graphs |
scientific article; zbMATH DE number 6164623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Complexity Dichotomy for the Coloring of Sparse Graphs |
scientific article; zbMATH DE number 6164623 |
Statements
A Complexity Dichotomy for the Coloring of Sparse Graphs (English)
0 references
21 May 2013
0 references
homomorphism
0 references
complexity
0 references
sparse graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9273122
0 references
0 references
0.92333466
0 references
0.9231606
0 references
0.9166911
0 references
0.9148606
0 references
