No label defined (Q4378635)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1124606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1124606 |
Statements
31 August 1998
0 references
domination
0 references
domatic number
0 references
0.8356395363807678
0 references
0.8326146602630615
0 references
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].
0 references
