Pages that link to "Item:Q2857338"
From MaRDI portal
The following pages link to On the diameter of reconfiguration graphs for vertex colourings (Q2857338):
Displaying 17 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← links)
- Recolouring weakly chordal graphs and the complement of triangle-free graphs (Q2065883) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- Mixing colourings in \(2K_2\)-free graphs (Q2166319) (← links)
- Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- (Q5026983) (← links)
- Toward Cereceda's conjecture for planar graphs (Q5110690) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)