On f-edge Cover Chromatic Index of Multigraphs  

作　　者：JIA YAN-BIN Xu CHANG-QING 

机构地区：[1]Department of Applied Mathematics, Hebei University of Technology, Tianjin, 300401 [2]Group of Mathematics, Tianjin Experimental High School, Tianjin, 300074

出　　处：《Communications in Mathematical Research》2009年第5期429-432,共4页数学研究通讯（英文版）

基　　金：The HENSF(A2007000002);NSF(10871058)of China

摘　　要：Let G be a multigraph with vertex set V（G）. Assume that a positive integer f（v） with 1 ≤ f（v） ≤ d（v） is associated with each vertex v ∈ V. An edge coloring of G is called an f-edge cover-coloring, if each color appears at each vertex v at least f（v） times. Let X＇fc（G） be the maximum positive integer k for which an f-edge cover-coloring with k colors of G exists. In this paper, we give a new lower bound of X＇fc（G）, which is sharp.Let G be a multigraph with vertex set V（G）. Assume that a positive integer f（v） with 1 ≤ f（v） ≤ d（v） is associated with each vertex v ∈ V. An edge coloring of G is called an f-edge cover-coloring, if each color appears at each vertex v at least f（v） times. Let X＇fc（G） be the maximum positive integer k for which an f-edge cover-coloring with k colors of G exists. In this paper, we give a new lower bound of X＇fc（G）, which is sharp.

关 键 词：edge coloring f-edge cover-coloring f-edge cover 

分 类 号：O157.5[理学—数学] P158[理学—基础数学]