Pages that link to "Item:Q2833252"
From MaRDI portal
The following pages link to A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252):
Displaying 21 items.
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← 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)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- (Q5075761) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (Q6201022) (← links)
