On the tractability of \(( k , i )\)-coloring (Q2235289)
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 tractability of ( k , i )-coloring |
scientific article; zbMATH DE number 7412196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the tractability of \(( k , i )\)-coloring |
scientific article; zbMATH DE number 7412196 |
Statements
On the tractability of \(( k , i )\)-coloring (English)
0 references
21 October 2021
0 references
graph coloring
0 references
parameterized algorithms
0 references
NP-completeness
0 references
0 references
0.99999994
0 references
0 references
0.90402436
0 references
0 references
0 references
0 references
0.89137876
0 references
0 references
