Pages that link to "Item:Q3503504"
From MaRDI portal
The following pages link to Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504):
Displaying 11 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Recolouring-resistant colourings (Q548277) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
- The complexity of change (Q2875857) (← links)
- Finding paths between 3-colorings (Q2998926) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)