Some class 1 graphs on gc-colorings
Some class 1 graphs on gc-colorings
复制标题
DOI：
10.1007/s10114-016-5519-y
复制
发表时间：
2016-09
期刊：
影响因子：
--
通讯作者：
Huawen Ma;Xia Zhang
中科院分区：
文献类型：
--
作者：
Huawen Ma;Xia Zhang
An edge-coloring of a graphGis an assignment of colors to all the edges ofG. Agc-coloring of a graphGis an edge-coloring of G such that each color appears at each vertex at leastg(v) times. The maximum integerksuch thatGhas agc-coloring withkcolors is called thegc-chromatic index ofGand denoted by(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graphGto satisfy(G) =δg(G), where.
