Connected \(k\)-dominating graphs (Q1618230): Difference between revisions

@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+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 @@
+Q3451017
@@ Property / cites work: Q3451017 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-dominating graph
@@ Property / cites work: The \(k\)-dominating graph / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguring dominating sets in some well-covered and other classes of graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / 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 dominating sets
@@ Property / cites work: Reconfiguration of dominating sets / rank @@
+Normal rank