linear 2-arboricityedge-partitionmaximum degreeThe linear 2-arboricity la2(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 l
Given a graph G, we define its linear arboricity, denoted by la(G), to be the minimum number of edge-disjoint linear forests in G whose union is E(G). This notion was introduced by Harary [16] in 1970 as one of the covering invariants of graphs, and has been studied quite ...
Wang, W.: Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. Discret. Math. 306, 262–270 (2006) Article MathSciNet MATH Google Scholar Wang, Y.: An improved upper bound on the linear 2-arboricity of planar graphs. Discret. Math. 339, 39–45 (2016...
1. Thelinear 2-arboricityof planar graphs without 4-cycles; 不含4-圈的平面图的线性2-荫度 2. Thelinear 2-arboricityla_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. ...
1. Thelinear 2-arboricityof planar graphs without 4-cycles; 不含4-圈的平面图的线性2-荫度 2. Thelinear 2-arboricityla_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. ...
1. Thelinear 2-arboricityof planar graphs without 4-cycles; 不含4-圈的平面图的线性2-荫度 2. Thelinear 2-arboricityla_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. ...
1. The vertex linear arboricity of the integer distance graph; 整数距离图G(D_(m,3))的点线性荫度 2. The vertex linear arboricity of the integer distance graph G(D_(m,2)); 整数距离图G(D_(m,2))的点线性荫度 3. Here the vertex linear arboricity of integer distance graph G(D)(den...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1981, Akiyama, Exoo and Harary conjectured that Δ(G)/2 ≤ la(G) ≤Δ(G) 1/2 for any simple graph G. A graph G is 1-planar if it can be drawn in the ...
1-planar graphlinear 2-arboricityedge-partitionmaximum degreeThe 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 ...
1-Planar graphlinear 2-arboricityedge-partitionmaximum degreeThe linear 2-arboricity la[Formula: see text] of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] can be partitioned into [Formula: see text] edge-disjoint forests, whose ...