Some Class 1 Graphs on gc-colorings  

作　　者：Hua Wen MA Xia ZHANG 

机构地区：[1]School of Mathematical Sciences,Shandong Normal University,Ji'nan 250014,P·R·China

出　　处：《Acta Mathematica Sinica,English Series》2016年第10期1237-1245,共9页数学学报（英文版）

基　　金：Supported by Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014JL001);the Shandong Province Higher Educational Science and Technology Program(Grant No.J13LI04);the Excellent Young Scholars Research Fund of Shandong Normal University of China

摘　　要：An edge-coloring of a graph G is an coloring of a graph G is an edge-coloring of G such assignment of colors to all the edges of G. A go- that each color appears at each vertex at least g（v） times. The maximum integer k such that G has a go-coloring with k colors is called the gc-chromatic index of G and denoted by X＇gc （G）. In this paper, we extend a result on edge-covering coloring of Zhang X＇gc（ ） = δg（G）, and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy ＇ x＇gc（G）=δg（G）,where δg（G）=minv∈V（G）{[d（v）/g（v）]}.An edge-coloring of a graph G is an coloring of a graph G is an edge-coloring of G such assignment of colors to all the edges of G. A go- that each color appears at each vertex at least g（v） times. The maximum integer k such that G has a go-coloring with k colors is called the gc-chromatic index of G and denoted by X＇gc （G）. In this paper, we extend a result on edge-covering coloring of Zhang X＇gc（ ） = δg（G）, and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy ＇ x＇gc（G）=δg（G）,where δg（G）=minv∈V（G）{[d（v）/g（v）]}.

关 键 词：EDGE-COLORING go-coloring go-chromatic index edge covering classification problem 

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