Complexity of unique list colorability (Q935144)
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 5306530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of unique list colorability |
scientific article; zbMATH DE number 5306530 |
Statements
Complexity of unique list colorability (English)
0 references
31 July 2008
0 references
graph coloring
0 references
list coloring
0 references
unique coloring
0 references
complexity
0 references
polynomial hierarchy
0 references
0.881994903087616
0 references
0.866698682308197
0 references
0.8662340641021729
0 references
0.8655765056610107
0 references
