A note on non-dominating set partitions in graphs
DOI10.7151/DMGT.1895zbMATH Open1350.05120OpenAlexW2404622858MaRDI QIDQ339496FDOQ339496
Authors: 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
Recommendations
- scientific article; zbMATH DE number 6311742
- A note on disjoint dominating sets in graphs
- A note on \(k\)-partitions of graphs
- scientific article; zbMATH DE number 1202982
- scientific article; zbMATH DE number 2061963
- A note on the complexity of the total domatic partition problem in graphs
- A note on partitions of graphs under degree constraints
- Partitioned graphs and domination related parameters
- NP-completeness results for partitioning a graph into total dominating sets
- NP-completeness results for partitioning a graph into total dominating sets
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Approximating theDomatic Number
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Pairs of disjoint dominating sets in connected cubic graphs
- Remarks about disjoint dominating sets
- Trees with large total domination number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: A note on non-dominating set partitions in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339496)
