The following pages link to (Q3104271):
Displaying 6 items.
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- Recoloring some hereditary graph classes (Q6657243) (← links)
