| 最大度为6的平面图是13-线性可染的 |
| |
| 引用本文： | 王侃.最大度为6的平面图是13-线性可染的[J].浙江师范大学学报(自然科学版),2012,35(2):121-124. |
| |
| 作者姓名： | 王侃 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院,浙江金华,321004 |
| |
| 基金项目： | 国家自然科学基金资助项目(11071223);浙江省自然科学基金重点项目(Z6090150);浙江省教育厅科研项目(Y201121311) |
| |
| 摘 要： | 图G的线性色数lc（G）是指G的所有线性染色中所用的最少颜色的个数．运用Discharging方法，研究了平面图的线性色数问题，证明了最大度为6的平面图是13-线性可染的．
|
| 关 键 词： | 平面图 线性染色 线性色数 最大度 |
Plane graphs with maximum degree 6 are 13-linear-colorable |
| |
| WANG Kan.Plane graphs with maximum degree 6 are 13-linear-colorable[J].Journal of Zhejiang Normal University Natural Sciences,2012,35(2):121-124. |
| |
| Authors: | WANG Kan |
| |
| Institution: | WANG Kan(College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua Zhejiang 321004,China) |
| |
| Abstract: | The linear chromatic number lc(G) of the graph G was defined as the smallest number of colors in a linear coloring of G.It was studied the linear chromatic number of planar graphs,using the method of discharging,planar graphs with maximum degree 6 were showed to be 13-linear-colorable. |
| |
| Keywords: | planar graphs linear coloring linear chromatic number maximum degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
