Pages that link to "Item:Q2222045"
From MaRDI portal
The following pages link to Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045):
Displayed 8 items.
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Optimally reconfiguring list and correspondence colourings (Q6057471) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)