Complexity dichotomy for list-5-coloring with a forbidden induced subgraph (Q5099103)
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: Complexity dichotomy for list-5-coloring with a forbidden induced subgraph |
scientific article; zbMATH DE number 7578863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity dichotomy for list-5-coloring with a forbidden induced subgraph |
scientific article; zbMATH DE number 7578863 |
Statements
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (English)
0 references
31 August 2022
0 references
coloring
0 references
list coloring
0 references
induced subgraphs
0 references
computational complexity
0 references
0 references
0 references
0.8790765404701233
0 references
0.8727771639823914
0 references
0.8708431720733643
0 references
0.8673596978187561
0 references
0.8593382239341736
0 references
