| 不含4-圈和5-圈的平面图的线性2-荫度 |
| |
| 引用本文： | 王苒群,左连翠. 不含4-圈和5-圈的平面图的线性2-荫度[J]. 山东大学学报(理学版), 2012, 47(6): 71-75 |
| |
| 作者姓名： | 王苒群 左连翠 |
| |
| 作者单位： | 天津师范大学数学科学学院,天津,300387 |
| |
| 基金项目： | 国家自然科学基金青年基金资助项目(61103073) |
| |
| 摘 要： | 线性k-森林是每一个连通分支均为长度不超过k的路的图。一个图G的线性k-荫度是将图G的边集合能分解成的线性k-森林的最少数目,用lak(G)来表示。证明了:若G为不含4-圈和5-圈的平面图,则la2(G)≤「Δ(G)+1/2■+4。
|
| 关 键 词： | 线性k-森林 线性k-荫度 线性荫度 平面图 |
The linear 2-arboricity of plane graphs without 4-cycles and 5-cycles |
| |
| WANG Ran-qun,ZUO Lian-cui. The linear 2-arboricity of plane graphs without 4-cycles and 5-cycles[J]. Journal of Shandong University, 2012, 47(6): 71-75 |
| |
| Authors: | WANG Ran-qun ZUO Lian-cui |
| |
| Affiliation: | (School of Mathematical Sciences,Tianjin Normal University,Tianjin 300387,China) |
| |
| Abstract: | A linear k-forest is a forest whose components are paths of length at most k.The linear k-arboricity of a graph G,denoted by lak(G),is the least number of linear k-forests needed to decompose G.We have: if G is a plane graph without 4-cycles and 5-cycles,then la2(G)≤「Δ(G)+1/2■+4. |
| |
| Keywords: | linear k-forest linear k-arboricity linear arboricity plane graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
