The following pages link to Introduction to reconfiguration (Q2331456):
Displaying 50 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Editorial: Special issue on reconfiguration problems (Q1712044) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← 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)
- Token sliding on split graphs (Q2048202) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Cliques in realization graphs (Q2092412) (← links)
- Hamilton paths in dominating graphs of trees and cycles (Q2093102) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- A triangle process on regular graphs (Q2115867) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← 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)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs (Q2213805) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
- Cyclic shift problems on graphs (Q2232257) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Token shifting on graphs (Q2695335) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Approximating Shortest Connected Graph Transformation for Trees (Q3297756) (← links)
- (Q5005179) (← links)
- (Q5075806) (← links)
- (Q5090459) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
