Pages that link to "Item:Q1045182"
From MaRDI portal
The following pages link to Remarks about disjoint dominating sets (Q1045182):
Displaying 20 items.
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- On disjoint maximal independent sets in graphs (Q458376) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Elimination properties for minimal dominating sets of graphs (Q2107746) (← links)
- On graph fall-coloring: existence and constructions (Q2287754) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- 1-well-covered graphs revisited (Q2311371) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Disjoint dominating sets with a perfect matching (Q4595255) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)