Pages that link to "Item:Q2955037"
From MaRDI portal
The following pages link to Homomorphism reconfiguration via homotopy (Q2955037):
Displaying 22 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Square-free graphs are multiplicative (Q345100) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Degree-Constrained Subgraph Reconfiguration is in P (Q2946420) (← links)
- Four-cycle free graphs, height functions, the pivot property and entropy minimality (Q2989978) (← 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)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- (Q6087216) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
- Galactic token sliding (Q6098154) (← links)
- Mixing is hard for triangle-free reflexive graphs (Q6146497) (← links)
