标题:New Upper Bounds on Linear Coloring of Planar Graphs
作者:Bin LIU;Gui Zhen LIU;
作者机构:[Bin LIU]Department of Mathematics, Ocean University of China;[Gui Zhen LIU]School of Mathematics, Shandong University
通讯作者:Liu, B(sduliubin@163.com)
通讯作者地址:[Liu, B]Ocean Univ China, Dept Math, Qingdao 266100, Peoples R China.
来源:Acta Mathematica Sinica
出版年:2012
卷:28
期:6
页码:1187-1196
DOI:10.1007/s10114-011-0317-z
关键词:Linear coloring; planar graph; girth
摘要:A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc(G) of the graph G is the smallest number of colors in a linear coloring of G. In this paper, it is proved that every pla...
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:http://kns.cnki.net/kns/detail/detail.aspx?FileName=ACMS201206009&DbName=CJFQ2012
TOP