Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161)
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: Parameterized complexity of the list coloring reconfiguration problem with graph parameters |
scientific article; zbMATH DE number 6890643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of the list coloring reconfiguration problem with graph parameters |
scientific article; zbMATH DE number 6890643 |
Statements
Parameterized complexity of the list coloring reconfiguration problem with graph parameters (English)
0 references
18 June 2018
0 references
combinatorial reconfiguration
0 references
graph algorithm
0 references
list coloring
0 references
fixed-parameter algorithm
0 references
W[1]-hardness
0 references
0 references
0 references
0 references
0.9722483
0 references
0.93209934
0 references
0 references
0.92322206
0 references
0.91379243
0 references
0.9076401
0 references
0.9056628
0 references
0.9056628
0 references
