About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Zelinka, Bohdan
Edge-domatic numbers of cacti. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 91-95
MSC: 05C15, 05C35, 05C70, 05C99 | MR 1100426 | Zbl 0743.05032 | DOI: 10.21136/MB.1991.126190
Keywords:
edge-domatic number; cactus; dominating; edge-domatic partition; round; round cactus
Summary:
The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.
References:
[1] E. J. Cockayne S. T. Hedetniemi: Towards a theory of domination in graphs. Networks 7 (1977), 247-261. DOI 10.1002/net.3230070305 | MR 0483788
[2] B. Zelinka: Edge-domatic number of a graph. Czechoslovak Math. J. 33 (198З), 107-110. MR 0687422
Partner of
EuDML logo