On the tractability of \(( k , i )\)-coloring (Q2235289): Difference between revisions
From MaRDI portal
Latest revision as of 21:40, 26 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the tractability of \(( k , i )\)-coloring |
scientific article |
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