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 co...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 min[d(v)-1/f(v)]≤xfc(G)≤展开更多
文摘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 min[d(v)-1/f(v)]≤xfc(G)≤
