| 最大度为5的平面图是11-线性可染的 |
| |
| 引用本文： | 王侃,王维凡. 最大度为5的平面图是11-线性可染的[J]. 数学研究及应用, 2012, 32(6): 641-653 |
| |
| 作者姓名： | 王侃 王维凡 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院, 浙江 金华 321004;浙江师范大学数理与信息工程学院, 浙江 金华 321004 |
| |
| 基金项目： | 国家自然科学基金资助项目(Grant No.11071223),浙江省自然科学基金重点项目(Grant No.Z6090150),浙江省教育厅科研项目(Grant No.Y201121311). |
| |
| 摘 要： | 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) o...
|
| 关 键 词： | planar graph linear coloring maximum degree. |
| 收稿时间： | 2011-06-21 |
| 修稿时间： | 2011-12-19 |
Plane Graphs with Maximum Degree 5 Are 11-Linear-Colorable |
| |
| Kan WANG and Weifan WANG. Plane Graphs with Maximum Degree 5 Are 11-Linear-Colorable[J]. Journal of Mathematical Research with Applications, 2012, 32(6): 641-653 |
| |
| Authors: | Kan WANG and Weifan WANG |
| |
| Affiliation: | College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Zhejiang 321004, P.R.China |
| |
| Abstract: | 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. |
| |
| Keywords: | planar graph linear coloring maximum degree. |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
