Pages that link to "Item:Q3525616"
From MaRDI portal
The following pages link to Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (Q3525616):
Displaying 17 items.
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- (Q5075761) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Digraph redicolouring (Q6146501) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
