Pages that link to "Item:Q1034528"
From MaRDI portal
The following pages link to Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528):
Displaying 41 items.
- Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Finding paths between 3-colorings (Q2998926) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
- ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- (Q5026983) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Diameter of colorings under Kempe changes (Q5918932) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Optimally reconfiguring list and correspondence colourings (Q6057471) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- Digraph redicolouring (Q6146501) (← links)
- Reconfiguration of vertex colouring and forbidden induced subgraphs (Q6201889) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis (Q6575399) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q6621198) (← links)
- The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753) (← links)
- Recoloring some hereditary graph classes (Q6657243) (← links)
- List recoloring of planar graphs (Q6671387) (← links)
