Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
From MaRDI portal
Recommendations
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
- Finding paths between 3-colourings
- Finding paths between 3-colorings
- The coloring reconfiguration problem on specific graph classes
Cited in
(21)- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Mixing 3-colourings in bipartite graphs
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Recoloring graphs via tree decompositions
- The coloring reconfiguration problem on specific graph classes
- \textsf{PSPACE}-hardness of variants of the graph coloring game
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
- An update on reconfiguring 10-colorings of planar graphs
- Recoloring graphs of treewidth 2
- Introduction to reconfiguration
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Reconfiguring 10-colourings of planar graphs
- The complexity of change
- Finding paths between 3-colorings
- Finding paths between 3-colourings
- Reconfiguration of List Edge-Colorings in a Graph
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
- Linear transformations between colorings in chordal graphs
- Recognizing Graphs Close to Bipartite Graphs
- Digraph redicolouring
- Redicolouring digraphs: directed treewidth and cycle-degeneracy
This page was built for publication: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525616)
