Hits :

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2003-01-01

Document Type : 期刊

Journal : Graphs and Combinatorics

Volume: Vol.19

Issue : NO.2

Page Number : 241-248

ISSN : 0911-0119

Translation or Not : no

Abstract : Let G be a planar graph with maximum degree Δ and girth g. The linear 2-arboricity la 2 (G) of 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 (1) la