| Title:
|
Edge-domatic numbers of cacti (English) |
| Author:
|
Zelinka, Bohdan |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
116 |
| Issue:
|
1 |
| Year:
|
1991 |
| Pages:
|
91-95 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| 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. (English) |
| Keyword:
|
edge-domatic number |
| Keyword:
|
cactus |
| Keyword:
|
dominating |
| Keyword:
|
edge-domatic partition |
| Keyword:
|
round |
| Keyword:
|
round cactus |
| MSC:
|
05C15 |
| MSC:
|
05C35 |
| MSC:
|
05C70 |
| MSC:
|
05C99 |
| idZBL:
|
Zbl 0743.05032 |
| idMR:
|
MR1100426 |
| DOI:
|
10.21136/MB.1991.126190 |
| . |
| Date available:
|
2009-09-24T20:43:16Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/126190 |
| . |
| Reference:
|
[1] E. J. Cockayne S. T. Hedetniemi: Towards a theory of domination in graphs.Networks 7 (1977), 247-261. MR 0483788, 10.1002/net.3230070305 |
| Reference:
|
[2] B. Zelinka: Edge-domatic number of a graph.Czechoslovak Math. J. 33 (198З), 107-110. MR 0687422 |
| . |
