A note on non-dominating set partitions in graphs
From MaRDI portal
Publication:339496
DOI10.7151/dmgt.1895zbMath1350.05120OpenAlexW2404622858MaRDI QIDQ339496
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning
Publication date: 11 November 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1895
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks about disjoint dominating sets
- Pairs of disjoint dominating sets in connected cubic graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Approximating theDomatic Number
- Total Domination in Graphs