Hits :

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

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Bulletin of the Malaysian Mathematical Sciences Society

Volume: Vol.41

Issue : No.4

Page Number : 1907-1921

ISSN : 0126-6705;2180-4206

Translation or Not : no

Key Words : Toroidal;graph;Linear;2-arboricity;Maximum;degree;Cycles

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. In this paper, we prove that if G is a toroidal graph with maximum de