The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Partitions and edge colourings of multigraphs.”
The excessive [3]-index of all graphs.
Edge-domatic numbers of directed graphs
Bohdan Zelinka (1995)
Czechoslovak Mathematical Journal
Similarity:
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.
On a Problem in Map Colouring
Ernest Jucovič (1969)
Matematický časopis
Similarity:
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Štefan Znám (1967)
Matematický časopis
Similarity:
Simultaneous Colouring of 4-Valent Maps
Jozef Fiamčík (1971)
Matematický časopis
Similarity: