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 at least f(υ) 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 χfc(G). This paper gives that min[d(ν)-1/f(ν)] ≤χfc(G) ≤min[d(υ)/f(υ)].
作 者： Song Huimin Liu Guizhen 作者单位： Song Huimin(Department of Applied Mathematics, Shandong University at Weihai, Weihai 264209, China)Liu Guizhen(Department of Mathematics, Shandong University, Jinan 250100, China)
刊 名： 数学物理学报（英文版） ISTIC SCI 英文刊名： ACTA MATHEMATICA SCIENTIA 年，卷(期)： 2005 25(1) 分类号： 关键词： Edge colouring edge cover-colouring f-edge cover-colouring