Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964264940 / rank | |||
Normal rank | |||
| Property / title | |||
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English) | |||
| Property / title: Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English) / rank | |||
Normal rank | |||
Latest revision as of 09:05, 30 July 2024
scientific article; zbMATH DE number 7204385
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters |
scientific article; zbMATH DE number 7204385 |
Statements
26 May 2020
0 references
combinatorial reconfiguration
0 references
fixed-parameter tractability
0 references
graph algorithm
0 references
list coloring
0 references
W[1]-hardness
0 references
0 references
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English)
0 references
