标题:Edge Coloring by Total Labelings of Outerplanar Graphs
作者:Guang Hui WANG[1];Gui Ying YAN[2]
作者机构:[Guang Hui WANG]School of Mathematics, Shandong University, Ji\'nan 250100, P. R. China.;[Gui Ying YAN]Academy of Mathematics and System Sciences, Chi 更多
通讯作者:Wang, G H(ghwang@sdu.edu.cn)
通讯作者地址:[Wang, GH]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:数学学报:英文版
出版年:2013
卷:29
期:11
页码:2129-2136
DOI:10.1007/s10114-013-2294-x
关键词:外平面图;边染色;标号;重定义;标签;最大度;顶点;全钾;
摘要:An edge coloring total k-labeling is a labeling of the vertices and the edges of a graph G with labels {1, 2, ... , k} such that the weights of the edges define a proper edge coloring of G. Here the weight of an edge is the sum of its label and the labels of its two end vertices. This concept was introduce by Brandt et al. They defined chi(t)'(G) to be the smallest integer k for which G has an edge coloring total k-labeling and proposed a question: Is there a constant K with chi(t)'(G) <= Delta(G)+1/2 + K for all graphs G of maximum degree Delta(G)? In this paper, we give a positive answer for outerplanar graphs by showing that chi(t)'(G) <= [Delta(G)+1/2] + 1 for each outerplanar graph G with maximum degree Delta(G).
收录类别:CSCD;SCOPUS;SCIE
资源类型:期刊论文
原文链接:http://lib.cqvip.com/qk/85800X/201311/47497715.html
TOP