Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300): Difference between revisions

@@ Property / cites work @@
+Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
+Normal rank
@@ 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 @@
+Using contracted solution graphs for solving reconfiguration problems
+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 @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Some perfect coloring properties of graphs
@@ Property / cites work: Some perfect coloring properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 @@
+Incremental optimization of independent sets under the reconfiguration framework
+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 @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+\(\beta\)-perfect graphs
@@ Property / cites work: \(\beta\)-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5133651
@@ Property / cites work: Q5133651 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to reconfiguration
@@ Property / cites work: Introduction to reconfiguration / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Reconfiguration in bounded bandwidth and tree-depth
+Normal rank