[HTML][HTML] Linear k-arboricities on trees
GJ Chang, BL Chen, HL Fu, KC Huang - Discrete applied mathematics, 2000 - Elsevier
For a fixed positive integer k, the linear k-arboricity lak (G) of a graph G is the minimum
number ℓ such that the edge set E (G) can be partitioned into ℓ disjoint sets and that each …
number ℓ such that the edge set E (G) can be partitioned into ℓ disjoint sets and that each …
The linear 2-arboricity of planar graphs
KW Lih, LD Tong, WF Wang - Graphs and Combinatorics, 2003 - Springer
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 …
of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose …
[HTML][HTML] Light structures in 1-planar graphs with an application to linear 2-arboricity
J Liu, X Hu, W Wang, Y Wang - Discrete Applied Mathematics, 2019 - Elsevier
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 …
partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2 …
On the linear k-arboricity of Kn and Kn, n
BL Chen, KC Huang - Discrete mathematics, 2002 - Elsevier
A linear k-forest of a undirected graph G is a subgraph of G whose components are paths
with lengths at most k. The linear k-arboricity of G, denoted by la k (G), is the minimum …
with lengths at most k. The linear k-arboricity of G, denoted by la k (G), is the minimum …
Algorithmic aspects of linear k-arboricity
GJ Chang - Taiwanese Journal of Mathematics, 1999 - projecteuclid.org
For a fixed positive integer $ k $, the linear $ k $-arboricity $\rm la_k (G) $ of a graph $ G $ is
the minimum number $\ell $ such that the edge set $ E (G) $ can be partitioned into $\ell …
the minimum number $\ell $ such that the edge set $ E (G) $ can be partitioned into $\ell …
[HTML][HTML] Planar graphs without 5-cycles or without 6-cycles
Let G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that if G
is connected and δ (G)≥ 2, then there exists an edge xy∈ E (G) such that d (x)+ d (y)≤ 9, or …
is connected and δ (G)≥ 2, then there exists an edge xy∈ E (G) such that d (x)+ d (y)≤ 9, or …
Linear 2-arboricity of toroidal graphs
W Wang, Y Li, X Hu, Y Wang - Bulletin of the Malaysian Mathematical …, 2018 - Springer
Abstract The linear 2-arboricity la _2 (G) 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 …
can be partitioned into k edge-disjoint forests, whose component trees are paths of length at …
[HTML][HTML] On the linear (n− 1)-arboricity of Kn (m)
B Xue, L Zuo - Discrete applied mathematics, 2010 - Elsevier
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths
with lengths at most k. The linear k-arboricity of G, denoted by lak (G), is the minimum …
with lengths at most k. The linear k-arboricity of G, denoted by lak (G), is the minimum …
An improved upper bound on the linear 2-arboricity of 1-planar graphs
J Liu, YQ Wang, P Wang, L Zhang… - Acta Mathematica Sinica …, 2021 - Springer
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 …
partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2 …
[HTML][HTML] An improved upper bound on the linear 2-arboricity of planar graphs
Y Wang - Discrete Mathematics, 2016 - Elsevier
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 …
partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2 …