On the complexity of a restricted list-coloring problem (Q1296975)
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: On the complexity of a restricted list-coloring problem |
scientific article; zbMATH DE number 1320580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of a restricted list-coloring problem |
scientific article; zbMATH DE number 1320580 |
Statements
On the complexity of a restricted list-coloring problem (English)
0 references
3 August 1999
0 references
restricted list-coloring
0 references
polynomial algorithm
0 references
0.8581162095069885
0 references
0.8472464084625244
0 references
0.8224691152572632
0 references
