摘要
图G的线性2荫度la2(G)是将G分解为k个边不交的森林的最小整数k,其中每个森林的分支树的长度至多为2的路.给出了Halin图G的线性2荫度.
The linear 2 -arboricity laz (G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. in this paper, the linear 2-arboricity of Haling graphs was derived.
出处
《山东理工大学学报(自然科学版)》
CAS
2006年第3期3-5,8,共4页
Journal of Shandong University of Technology:Natural Science Edition
基金
国家自然科学基金(10471131)
浙江省自然科学基金(M103094)