不含弦6-圈的平面图的线性2-荫度  

The linear 2-arboricity of planar graphs without chordal-6-cycles

作　　者：常晶晶[1] 徐常青[1] 

机构地区：[1]河北工业大学理学院,天津300401

出　　处：《河北工业大学学报》2014年第5期76-79,共4页Journal of Hebei University of Technology

基　　金：国家自然科学基金青年基金(11301134);河北省自然科学基金(A2011202071)

摘　　要：线性2-森林是每个连通分支是长度至多为2的路的图,图的线性2-荫度是将边分解为k个线性2-森林的最小k值,记为la2(G).证明了若G为不含弦6-圈的平面图,则la2(G)≤[△(G)/2]+6.A linear 2-forest is a forest whose components are paths of length at most 2. The linear 2-arboricity of a graph G, is the least integer k, so that G can be decomposed into k linear 2-forests, which is denoted by la2 （ G）. We get that if G is a planar graph without chordal-6-cycles, then la2（G）≤[△（G）/2]＋6.

关 键 词：平面图 荫度 线性2-荫度 边分解 

分 类 号：O157.5[理学—数学]