Fast recoloring of sparse graphs (Q896058): 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 @@
+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 @@
+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 @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomly coloring sparse random graphs with fewer colors than the maximum degree
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of dominating sets
@@ Property / cites work: Reconfiguration of dominating sets / rank @@
+Normal rank