A dichotomy theorem for circular colouring reconfiguration (Q301588): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2016.05.015
@@ Property / DOI: 10.1016/j.tcs.2016.05.015 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05573
@@ Property / arXiv ID: 1508.05573 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
+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 @@
+Graphs with a cycle of length divisible by three
@@ Property / cites work: Graphs with a cycle of length divisible by three / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring digraphs with forbidden cycles
@@ Property / cites work: Coloring digraphs with forbidden cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
+Normal rank
@@ Property / cites work @@
+Cycles of length 0 modulo 4 in graphs
@@ Property / cites work: Cycles of length 0 modulo 4 in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / 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 @@
+Reconfiguration of list \(L(2,1)\)-labelings in a graph
+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 @@
+Star chromatic number
@@ Property / cites work: Star chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphism reconfiguration via homotopy
@@ Property / cites work: Homomorphism reconfiguration via homotopy / rank @@
+Normal rank
@@ Property / cites work @@
+Circular chromatic number: A survey
@@ Property / cites work: Circular chromatic number: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Circular colouring and orientation of graphs
@@ Property / cites work: Circular colouring and orientation of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2016.05.015
@@ Property / DOI: 10.1016/J.TCS.2016.05.015 / rank @@
+Normal rank