Q5111266 (Q5111266): Difference between revisions

@@ Property / cites work @@
+Recoloring graphs via tree decompositions
@@ Property / cites work: Recoloring graphs via tree decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
+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 @@
+A dichotomy theorem for circular colouring reconfiguration
+Normal rank
@@ Property / cites work @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomly coloring sparse random graphs with fewer colors than the maximum degree
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
+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 @@
+Finding shortest paths between graph colourings
@@ Property / cites work: Finding shortest paths between graph colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time modular decomposition of directed graphs
+Normal rank
@@ Property / cites work @@
+The complexity of change
@@ Property / cites work: The complexity of change / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration in bounded bandwidth and tree-depth
+Normal rank
@@ Property / cites work @@
+Homomorphism reconfiguration via homotopy
@@ Property / cites work: Homomorphism reconfiguration via homotopy / rank @@
+Normal rank