Pages that link to "Item:Q2946021"
From MaRDI portal
The following pages link to Finding Shortest Paths Between Graph Colourings (Q2946021):
Displaying 7 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
