Edge-domatic numbers of cacti
Bohdan Zelinka · Mathematica Bohemica · 1991
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.