The following pages link to The complexity of change (Q2875857):
Displaying 50 items.
- Classifying coloring graphs (Q284746) (← links)
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Square-free graphs are multiplicative (Q345100) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
