Hits :

First Author : Yiqiao Wang

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

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.340

Issue : No.7

Page Number : 1449-1455

ISSN : 0012-365X

Translation or Not : no

Key Words : Planar;graph;Linear;2-arboricity;Maximum;degree;Edge-partition

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 components are paths of length at most 2. In this paper, we prove that every planar graph G with Δ=10 has la 2 (G)≤9 .