On the tractability of \(( k , i )\)-coloring (Q2235289): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:23, 2 February 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
