Pages that link to "Item:Q1621073"
From MaRDI portal
The following pages link to Paths between colourings of sparse graphs (Q1621073):
Displayed 11 items.
- Dominating sets reconfiguration under token sliding (Q2032965) (← 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)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← 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)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)