Exploring the complexity boundary between coloring and list-coloring (Q5899384)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5158291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring the complexity boundary between coloring and list-coloring |
scientific article; zbMATH DE number 5158291 |
Statements
Exploring the complexity boundary between coloring and list-coloring (English)
0 references
29 May 2007
0 references
coloring
0 references
computational complexity
0 references
list-coloring
0 references
0.9999999
0 references
0.9256165
0 references
0.92537355
0 references
0.9251895
0 references
0 references
0.91304296
0 references
0.9086254
0 references
0 references
