| 不含3-圈和4-圈的平面图的线性2-荫度 |
| |
| 引用本文： | 王雪梅,李会序.不含3-圈和4-圈的平面图的线性2-荫度[J].河南纺织高等专科学校学报,2011(2):64-66,80. |
| |
| 作者姓名： | 王雪梅 李会序 |
| |
| 作者单位： | 河南工程学院数理科学系,河南郑州451191 |
| |
| 摘 要： | 线性森林是所有分支都为路的图,图G的线性荫度la（G）也就是把图的边集分解为互不相交的线性森林的最少数量k.设G为不含3-圈和4-圈的平面图,则la2（G）≤（Δ（G）＋1）/2]＋2.
|
| 关 键 词： | 图 染色 线性2-荫度 |
The Linear 2-arboricity of Planar Graphs without 3-cycles and 4-cycles |
| |
| WANG Xuemei,LI Huixu.The Linear 2-arboricity of Planar Graphs without 3-cycles and 4-cycles[J].Journal of Henan Textile College,2011(2):64-66,80. |
| |
| Authors: | WANG Xuemei LI Huixu |
| |
| Affiliation: | (Department of Mathematical and Physical Sciences,Henan Institute of Engineering,Zhengzhou 451191,China) |
| |
| Abstract: | A graph G is a linear forest if and only if every component of the graph is a path.The linear arboricity la（G） of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests.This paper will refer to the graphs without 3-cycles and 4-cycles.The result is la2（G）≤（Δ（G）＋1）/2]＋2. |
| |
| Keywords: | graph colouring linear 2-arboricity |
| 本文献已被 维普 等数据库收录！ |
|
