An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-20877-5_10
+Normal rank
@@ Property / OpenAlex ID @@
+W1510285934
@@ Property / OpenAlex ID: W1510285934 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+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