A note on disjoint dominating sets in graphs
From MaRDI portal
Publication:3145697
Recommendations
Cited in
(11)- Spanning trees with disjoint dominating and 2-dominating sets
- A note on the interval function of a disconnected graph
- Elimination properties for minimal dominating sets of graphs
- Disjoint dominating sets with a perfect matching
- Domination parameters with number 2: interrelations and algorithmic consequences
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Disjoint dominating and 2-dominating sets in graphs
- scientific article; zbMATH DE number 5531984 (Why is no real title available?)
- scientific article; zbMATH DE number 1934394 (Why is no real title available?)
- A note on non-dominating set partitions in graphs
- Minimal graphs with disjoint dominating and paired-dominating sets
This page was built for publication: A note on disjoint dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145697)