scientific article; zbMATH DE number 1124606
From MaRDI portal
Publication:4378635
The domatic number \(d(G)\) of a graph \(G\) is the maximum number of classes in a partition of the vertex set of \(G\) such that each class is a dominating set in \(G\). It is thus a domination-analogue to the chromatic number, which asks for partitions into independent sets. This paper gives a survey of results on the domatic number and its numerous variants, among them the total domatic number, the adomatic, idomatic, \(k\)-domatic, edge-domatic, complementarily domatic, semidomatic and antidomatic numbers. For the entire collection see [Zbl 0883.00011].
Recommendations
Cited in
(30)- Edge-disjoint trees containing some given vertices in a graph
- Domination parameters with number 2: interrelations and algorithmic consequences
- The total \(\{k\}\)-domatic number of wheels and complete graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- The Roman domatic problem in graphs and digraphs: a survey
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
- The k-domatic number of a graph
- Minimal dominating sets in maximum domatic partitions
- scientific article; zbMATH DE number 3843803 (Why is no real title available?)
- Fractional domatic, idomatic, and total domatic numbers of a graph
- Multiple domination
- Distance domination in graphs
- A note on non-dominating set partitions in graphs
- Coloring, location and domination of corona graphs
- scientific article; zbMATH DE number 3977044 (Why is no real title available?)
- scientific article; zbMATH DE number 125504 (Why is no real title available?)
- scientific article; zbMATH DE number 1260954 (Why is no real title available?)
- scientific article; zbMATH DE number 5913 (Why is no real title available?)
- Partitioning the vertices of a graph into two total dominating sets
- The b-domatic number of a graph
- Disjoint dominating and total dominating sets in graphs
- Graphs with disjoint dominating and paired-dominating sets
- On domatic number of graphs
- Dominating and total dominating partitions in cubic graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On the domatic numbers of queens graphs
- A characterization of graphs with disjoint dominating and paired-dominating sets
- A survey of selected recent results on total domination in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378635)
