An edge colouring of multigraphs

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

2-Regular equicolourings for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>P</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-designs

n/