Edge-domatic numbers of cacti
Mathematica Bohemica, Tome 116 (1991) no. 1, pp. 91-95
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR Zbl
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.
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.
DOI :
10.21136/MB.1991.126190
Classification :
05C15, 05C35, 05C70, 05C99
Keywords: edge-domatic number; cactus; dominating; edge-domatic partition; round; round cactus
Keywords: edge-domatic number; cactus; dominating; edge-domatic partition; round; round cactus
Zelinka, Bohdan. Edge-domatic numbers of cacti. Mathematica Bohemica, Tome 116 (1991) no. 1, pp. 91-95. doi: 10.21136/MB.1991.126190
@article{10_21136_MB_1991_126190,
author = {Zelinka, Bohdan},
title = {Edge-domatic numbers of cacti},
journal = {Mathematica Bohemica},
pages = {91--95},
year = {1991},
volume = {116},
number = {1},
doi = {10.21136/MB.1991.126190},
mrnumber = {1100426},
zbl = {0743.05032},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126190/}
}