Finding shortest paths between graph colourings (Q309791): Difference between revisions

@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Rerouting Shortest Paths
@@ Property / cites work: The Complexity of Rerouting Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set Reconfiguration in Cographs
@@ Property / cites work: Independent Set Reconfiguration in Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2957511
@@ Property / cites work: Q2957511 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
+Normal rank
@@ Property / cites work @@
+Reconfiguring Independent Sets in Claw-Free Graphs
+Normal rank
@@ Property / cites work @@
+Connectedness of the graph of vertex-colourings
@@ Property / cites work: Connectedness of the graph of vertex-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing 3-colourings in bipartite graphs
@@ Property / cites work: Mixing 3-colourings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+The complexity of change
@@ Property / cites work: The complexity of change / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of List Edge-Colorings in a Graph
@@ Property / cites work: Reconfiguration of List Edge-Colorings in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of List L(2,1)-Labelings in a Graph
+Normal rank
@@ Property / cites work @@
+An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
+Normal rank
@@ Property / cites work @@
+Approximability of the Subset Sum Reconfiguration Problem
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+Shortest paths between shortest paths
@@ Property / cites work: Shortest paths between shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover Reconfiguration and Beyond
@@ Property / cites work: Vertex Cover Reconfiguration and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of reconfiguration problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphism reconfiguration via homotopy
@@ Property / cites work: Homomorphism reconfiguration via homotopy / rank @@
+Normal rank