Journal of Graph TheoryS. BUIT, An inequality involving the vertex arboricity and edge arboricity of a graph, J. Graph Th. 10 (1986) 403 - 404.S. Burr, An inequality involving the vertex arboricity and edge arboricity of a graph, J. Graph Th. 10 (1986) 403 - 404....
摘要: The authors prove that the thickness and the arboricity of a graph with e edges are at most the bounds radic e/3+3/2 and radic e/2, respectively, and that the latter bound is best possible关键词: Theoretical or Mathematical/ graph theory/ thickness arboricity graph/ B0250 ...
4) the edge lin-ear arboricity of a graph 图的边线荫度 5) vertex arboricity 点荫度 1. Thevertex arboricityof the square of an outerplanar graph; 外平面图的平方图的点荫度 2. Thevertex arboricityof the integer distance graph G(D_ m,3); ...
The relationship between the maximum average degree and thelinear arboricityof a graph; 图的最大平均度与线性荫度的关系 2. It is proved here that a connected graph G has thelinear arboricityla(G)=「Δ/2 if |E| |V|+「3Δ/2-4.
New classes of graphs with edge δ− graceful labeling. AIMS Mathematics, 2022, 7(3): 3554-3589. doi: 10.3934/math.2022197 Abstract The vertex arboricity a(G) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. The...
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
Let G be a graph with maximum degree △.The linear 2-arboricity of G,denoted by la_2(G),is the least integer k such that G can be decomposed into k edge disjoint forests,whose component trees are paths of length at most 2.In this note,we show that(1)for general planar graphs,la...
Thevertex arboricityof the square of an outerplanar graph; 外平面图的平方图的点荫度 2. Thevertex arboricityof the integer distance graph G(D_ m,3); 整数距离图G(D_(m,30)的点荫度 3. In this paper, an upper and a lower bounds of thevertex arboricityof G(D m,k,3) are obtained and...
Zhang, "A Short Proof of Nash- Williams' Theorem for the Arboricity of a Graph" 1994・ Graphs and Combinatorics 10(27-28)CMWZZ94] B. Chen, M. Matsumoto, J. Wang, Z. Zhang and J. Zhang, \A Short Proof of Nash-Williams' Theorem for the Arboricity of a Graph," Graphs and ...
The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. In the present, it is proved that if a graph G can be embedded in a surface of Euler characteristic ε< 0 and Δ(G) ≥ (46 - 54ε)~(1/2) + 19, then its linear ...