IMCS/Publications/CSJM/Issues/CSJM v.15, n.2 (44), 2007/

An edge colouring of multigraphs

Authors: Mario Gionfriddo, Alberto Amato


We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,…,k} such that, for every non-pendant vertex χ of G, there exist at least two edges incident to χ and coloured by the same colour. The maximum number of colours in a strict edge colouring of G is called the upper chromatic index of G and is denoted by χ(G). In this paper we prove some results about it.

Mario Gionfriddo, Alberto Amato
Dipartimento di Matematica e Informatica
Universita di Catania
Viale Andrea Doria 6, 95125 Catania, Italia


Adobe PDF document0.13 Mb