Pages that link to "Item:Q2946012"
From MaRDI portal
The following pages link to The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (Q2946012):
Displaying 25 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- Distributed Recoloring (Q5090902) (← 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)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
