Pages that link to "Item:Q1034528"

The following pages link to Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528):

Displaying 50 items.

• A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
• Finding shortest paths between graph colourings (Q309791) (← links)
• Square-free graphs are multiplicative (Q345100) (← links)
• Reconfiguration of dominating sets (Q346508) (← links)
• The complexity of rerouting shortest paths (Q392173) (← links)
• Complexity of independent set reconfigurability problems (Q441866) (← links)
• Approximability of the subset sum reconfiguration problem (Q489711) (← links)
• Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
• The complexity of dominating set reconfiguration (Q517018) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• On the complexity of reconfiguration problems (Q631762) (← links)
• Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
• Shortest paths between shortest paths (Q719258) (← links)
• Fast recoloring of sparse graphs (Q896058) (← links)
• Connected \(k\)-dominating graphs (Q1618230) (← links)
• Paths between colourings of sparse graphs (Q1621073) (← links)
• Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
• Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
• Reconfiguration graphs of shortest paths (Q1660288) (← links)
• Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
• The coloring reconfiguration problem on specific graph classes (Q1699776) (← links)
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
• Recolouring reflexive digraphs (Q1744757) (← links)
• Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
• The \(k\)-dominating graph (Q2014712) (← links)
• Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
• Dominating sets reconfiguration under token sliding (Q2032965) (← links)
• (Lack of) model structures on the category of graphs (Q2046255) (← links)
• Hard problems that quickly become very easy (Q2059897) (← links)
• Irredundance graphs (Q2081464) (← links)
• On reconfigurability of target sets (Q2110378) (← links)
• A polynomial version of Cereceda's conjecture (Q2131856) (← links)
• Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
• Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
• Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← links)
• Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
• Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
• Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
• Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
• Computational complexity of jumping block puzzles (Q2695336) (← links)
• Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
• A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
• Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)