A note on non-dominating set partitions in graphs
From MaRDI portal
(Redirected from Publication:339496)
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
Cites work
- scientific article; zbMATH DE number 4127268 (Why is no real title available?)
- scientific article; zbMATH DE number 1202982 (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 1124606 (Why is no real title available?)
- 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
- Total domination in graphs
- Trees with large total domination number
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)