Edge-domatic numbers of directed graphs

Bohdan Zelinka

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Edge-domatic numbers of directed graphs”

Edge-domatic number of a graph

Bohdan Zelinka (1983)

Czechoslovak Mathematical Journal

Similarity:

Total edge-domatic number of a graph

Bohdan Zelinka (1991)

Mathematica Bohemica

Similarity:

The total edge-domatic number of a graph is introduced as an edge analogue of the total domatic number. Its values are studied for some special classes of graphs. The concept of totally edge-domatically full graph is introduced and investigated.

Edge-domatic numbers of cacti

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.