王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Ko-Wei Lih
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2004-01-01
Document Type : 期刊
Journal : Ars Combinatoria
Volume: Vol.73
Page Number : 13-22
ISSN : 0381-7032
Translation or Not : no
Abstract : The linear 2-arboricity la(2) (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. We prove that la2(G) less than or equal to [(Delta(G) + 4)/2] if G is a