Pages that link to "Item:Q5110690"
From MaRDI portal
The following pages link to Toward Cereceda's conjecture for planar graphs (Q5110690):
Displaying 12 items.
- Fast recoloring of sparse graphs (Q896058) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Farber's conjecture for planar graphs (Q2238222) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- (Q3772264) (← links)
- (Q5419973) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)