The following pages link to Finding paths between 3-colorings (Q2998926):
Displayed 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 rerouting shortest paths (Q392173) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- The \(k\)-dominating graph (Q2014712) (← links)
- Irredundance graphs (Q2081464) (← 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)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← 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)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Degree-Constrained Subgraph Reconfiguration is in P (Q2946420) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)