Partitioning a graph into a dominating set, a total dominating set, and something else
From MaRDI portal
Publication:2997583
Recommendations
- Partitioning the vertices of a graph into two total dominating sets
- Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
- scientific article; zbMATH DE number 6311742
- scientific article; zbMATH DE number 1202982
- scientific article; zbMATH DE number 2061963
- Domination partition in graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Total domination in partitioned graphs
- Dominator partitions of graphs
- Partitioned graphs and domination related parameters
Cited in
(12)- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- A note on graphs with disjoint dominating and total dominating sets
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Disjoint dominating and 2-dominating sets in graphs
- Dominating and total dominating partitions in cubic graphs
- Graphs with disjoint \(2\)-dominating sets
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- Disjoint dominating and total dominating sets in graphs
- scientific article; zbMATH DE number 6311742 (Why is no real title available?)
- Minimal graphs with disjoint dominating and paired-dominating sets
- Partitioning the vertices of a cubic graph into two total dominating sets
- A unified greedy approximation for several dominating set problems
This page was built for publication: Partitioning a graph into a dominating set, a total dominating set, and something else
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997583)
