Pages that link to "Item:Q2470462"
From MaRDI portal
The following pages link to Connectedness of the graph of vertex-colourings (Q2470462):
Displaying 50 items.
- Classifying coloring graphs (Q284746) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- A special \(k\)-coloring for a connected \(k\)-chromatic graph (Q1363668) (← links)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← 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)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- The \(k\)-dominating graph (Q2014712) (← links)
- Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Recolouring weakly chordal graphs and the complement of triangle-free graphs (Q2065883) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Irredundance graphs (Q2081464) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Mixing colourings in \(2K_2\)-free graphs (Q2166319) (← 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)
- Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
- Connected tropical subgraphs in vertex-colored graphs (Q2816516) (← links)
- Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
- A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Finding paths between 3-colorings (Q2998926) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
- (Q5026983) (← links)
