Plane Graphs with Maximum Degree 5 Are 11-Linear-Colorable

作     者：Kan WANG , Weifan WANGCollege of Mathematics, Physics and Information Engineering, Zhejiang Normal University,Zhejiang, 321004, P. R. China Kan WANG;Weifan WANG

作者机构：College of Mathematics Physics and Information Engineering Zhejiang Normal University Zhejiang 321004 

出 版 物：《Journal of Mathematical Research with Applications》 (数学研究及应用(英文版))

年 卷 期：2012年第32卷第6期

页      面：647-653页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (Grant No. 11071223) the Natural ScienceFoundation of Zhejiang Province (Grant No. Z6090150) Research Project of Zhejiang Educational Committee(Grant No. Y201121311) 

主　　题：planar graph linear coloring maximum degree. 

摘      要：A linear coloring of a graph G is a proper vertex coloring such that 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 G is the smallest number of colors in a linear coloring of G. In this paper, we prove that every planar graph G with maximum degree 5 is 11-linear-colorable.