| 某些不含5-圈的图的线性2-荫度 |
| |
| 引用本文： | 王雪梅,李会序.某些不含5-圈的图的线性2-荫度[J].科技信息,2011(29):I0166-I0167,I0093. |
| |
| 作者姓名： | 王雪梅 李会序 |
| |
| 作者单位： | 河南工程学院数理科学系; |
| |
| 摘 要： | 线性森林是所有分支都为路的图,图G的线性荫度la(G)也就是把图的边集分解为互不相交的线性森林的最少数量k.本文对将要讨论的不含5-圈的平面图做一些限制,这些图不含3-面与3-面相邻、4-面与4-面共用一条边的情况.设G为不含5-圈的如上述所示的平面图,则la2(G)≤(Δ(G)+1/2)+5.
|
| 关 键 词： | 图 染色 线性2-荫度 |
The Linear 2-Arboricity of Some Graphs Without 5-Cycles |
| |
| WANG Xue-mei LI Hui-xu.The Linear 2-Arboricity of Some Graphs Without 5-Cycles[J].Science,2011(29):I0166-I0167,I0093. |
| |
| Authors: | WANG Xue-mei LI Hui-xu |
| |
| Institution: | WANG Xue-mei LI Hui-xu(Henan Institute of Engineering,Zhengzhou Henan,451191) |
| |
| 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 5-cycles and without a 3-cycle adjacent to 3-cycle, a 4-cycle adjacent to 4-cycle.The result is la2（G）≤（Δ（G）＋1/2）＋5. |
| |
| Keywords: | Graph Dyeing The linear 2-arboricity |
| 本文献已被 CNKI 维普 等数据库收录！ |
