The following pages link to The \(k\)-dominating graph (Q2014712):
Displayed 26 items.
- Classifying coloring graphs (Q284746) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- Eternal domination: criticality and reachability (Q505466) (← 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)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← 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)
- Introduction to reconfiguration (Q2331456) (← links)
- Gamma graphs of some special classes of trees (Q2363620) (← links)
- Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
- On the structure of dominating graphs (Q2409507) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- (Q4994280) (← links)
- (Q5026983) (← links)
- γ-paired dominating graphs of cycles (Q5033094) (← links)
- Reconfiguring Minimum Dominating Sets in Trees (Q5216280) (← links)
- Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- Semitotal domination in claw-free cubic graphs (Q5915777) (← links)