The following pages link to Reconfiguration of dominating sets (Q346508):
Displaying 27 items.
- Classifying coloring graphs (Q284746) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Irredundance graphs (Q2081464) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
- On the structure of dominating graphs (Q2409507) (← links)
- Irredundance trees of diameter 3 (Q2675840) (← links)
- (Q2920477) (redirect page) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Reconfiguring Minimum Dominating Sets in Trees (Q5216280) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Linear transformations between dominating sets in the TAR-model (Q6087209) (← links)
- (Q6089671) (← links)
