Pages that link to "Item:Q2942408"
From MaRDI portal
The following pages link to The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs (Q2942408):
Displaying 8 items.
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
