Cites work
- Approximating theDomatic Number
- scientific article; zbMATH DE number 5531984 (Why is no real title available?)
- scientific article; zbMATH DE number 3675921 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2192114 (Why is no real title available?)
- scientific article; zbMATH DE number 2192159 (Why is no real title available?)
- Inverse domination in graphs
- On a conjecture about inverse domination in graphs.
- On minimum dominating sets with minimum intersection
- On minimum intersection of two minimum dominating sets of interval graphs
- Towards a theory of domination in graphs
- Trees with two disjoint minimum independent dominating sets
Cited in
(26)- Domination parameters with number 2: interrelations and algorithmic consequences
- Pairs of disjoint dominating sets in connected cubic graphs
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Spanning trees with disjoint dominating and 2-dominating sets
- Elimination properties for minimal dominating sets of graphs
- On graph fall-coloring: existence and constructions
- Disjoint dominating and 2-dominating sets in graphs
- 1-well-covered graphs revisited
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- Minimal graphs with disjoint dominating and paired-dominating sets
- Haar null and non-dominating sets
- A note on non-dominating set partitions in graphs
- Finding dominators via disjoint set union
- On disjoint maximal independent sets in graphs
- Disjoint dominating sets with a perfect matching
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
- On graphs admitting two disjoint maximum independent sets
- Remarks on ω-domination of discrete subspaces
- Graphs with disjoint 2-dominating sets
- Complexity of fall coloring for restricted graph classes
- Disjoint dominating and total dominating sets in graphs
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- Dominating and total dominating partitions in cubic graphs
- Disjoint maximal independent sets in graphs and hypergraphs
- Disjoint dominating and 2-dominating sets in graphs: hardness and approximation results
- Complexity of (p, q)-bipartition of planar and 1-planar graphs
This page was built for publication: Remarks about disjoint dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045182)
