The following pages link to Fast recoloring of sparse graphs (Q896058):
Displayed 22 items.
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- (Q5075761) (← links)
- Distributed Recoloring (Q5090902) (← links)
- On the connectivity of proper colorings of random graphs and hypergraphs (Q5128749) (← links)
- On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs (Q5875492) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Digraph redicolouring (Q6146501) (← links)