ON F-EDGE COVER-COLOURING OF SIMPLE GRAPHS

An f-edge cover-colouring of a graph G = (V, E) is an assignment of colours to the edges of G such that every colour appears at each vertex v ∈ V at least f(v) times. The maximum number of colours needed to f-edge cover colour G is called the f-edge cover chromatic index of G, denoted by xfc'(G). This paper gives that minv∈V⌊d(v)−1f(v)≤≤xfc'(G)≤minv∈V⌊d(v)f(v)≤.