Finding shortest paths between graph colourings
From MaRDI portal
Recommendations
Cites work
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
- Approximability of the Subset Sum Reconfiguration Problem
- Complexity of independent set reconfigurability problems
- Connectedness of the graph of vertex-colourings
- Finding paths between 3-colorings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Homomorphism reconfiguration via homotopy
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Incompressibility through Colors and IDs
- Independent set reconfiguration in cographs
- Kernelization Lower Bounds by Cross-Composition
- Mixing 3-colourings in bipartite graphs
- On the complexity of reconfiguration problems
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Reconfiguration of list \(L(2,1)\)-labelings in a graph
- Reconfiguration of List Edge-Colorings in a Graph
- Reconfiguring independent sets in claw-free graphs
- Rerouting shortest paths in planar graphs
- Shortest paths between shortest paths
- The complexity of bounded length graph recoloring and CSP reconfiguration
- The complexity of change
- The complexity of rerouting shortest paths
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Vertex Cover Reconfiguration and Beyond
Cited in
(25)- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Reconfiguration in bounded bandwidth and tree-depth
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Paths between colourings of graphs with bounded tree-width
- Reconfiguring graph homomorphisms on the sphere
- Using contracted solution graphs for solving reconfiguration problems
- Introduction to reconfiguration
- On the complexity of restoring corrupted colorings
- Decremental optimization of vertex-coloring under the reconfiguration framework
- The complexity of bounded length graph recoloring and CSP reconfiguration
- Finding shortest paths between graph colourings
- The complexity of (list) edge-coloring reconfiguration problem
- Finding paths between 3-colorings
- Finding paths between 3-colourings
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
- Shortest reconfiguration of perfect matchings via alternating cycles
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
- Recognizing Graphs Close to Bipartite Graphs
- Complexity of coloring reconfiguration under recolorability constraints
- Homomorphism reconfiguration via homotopy
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration
- Reachability of fair allocations via sequential exchanges
- On solution discovery via reconfiguration
This page was built for publication: Finding shortest paths between graph colourings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309791)
