1) edge arboricity
边荫度
1.
Let the vertex arboricity of G be denoted by a(G)and the edge arboricityof G by a1(G).
以ａ（Ｇ）ａ１（Ｇ）分别记图Ｇ的点荫度、边荫度，对任意Ｐ阶非平凡简单图Ｇ及其补图，本文得到以下Ｎｏｒｄｈａｕｓ－Ｇａｄｄｕｍ类型不等式：｜ｘ｜、｜ｘ｜分别表ｘ之上整数、下整数。
2) the edge lin-ear arboricity of a graph
图的边线荫度
3) arboricity
荫度
1.
The degree-constrained k-arboricity of outerplanar graphs;
外平面图度有限制的k-荫度
2.
In this paper, we discuss point arboricity of line graphs and obtain some bounds of point arboricity of line graphs.
文中讨论了线图的荫度，得到了线图荫度的若干界。
3.
This paper proves that the linear point--arboricity of any planar graph is atmost three,a conjecture given by Broere and Mynhardt and others.
Ｂｒｏｅｒｅ和Ｍｙｎｈａｒｄｔ等人猜想：任何平面图Ｇ的线性点荫度ｌａ（Ｇ）不超过３。
4) vertex arboricity
点荫度
1.
The vertex arboricity of the square of an outerplanar graph;
外平面图的平方图的点荫度
2.
The vertex arboricity of the integer distance graph G(D_ m,3);
整数距离图G(D_(m,30)的点荫度
3.
In this paper, an upper and a lower bounds of the vertex arboricity of G(Dm,k,3) are obtained and its values are determined for some special m.
对于m≥4k,k≥3,设Dm,k,3={1,2,…,m}\{k,2k,3k},得到了G(Dm,k,3)的点荫度的上界和下界并决定了它在某些m上的确切值。
6) edge-arboricity
线荫度
补充资料：緑荫荫
1.见"緑阴阴"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条