The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1995)
Czechoslovak Mathematical Journal
Similarity:
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
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.
Ernest Jucovič (1969)
Matematický časopis
Similarity: