Complexity of near-3-choosability problem (Q6632143)
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 of near-3-choosability problem |
scientific article; zbMATH DE number 7938182
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of near-3-choosability problem |
scientific article; zbMATH DE number 7938182 |
Statements
Complexity of near-3-choosability problem (English)
0 references
4 November 2024
0 references
graph coloring
0 references
list coloring
0 references
\(\mathbb{NP}\)-completeness
0 references
approximation algorithm
0 references
