1) rertex linear arboricity
点线荫度
2) vertex linear arboricity
点线性荫度
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)(denoted by vla(G(D)))is studied.
本文讨论整数距离图的点线性荫度,记为vla(G(D))。
3) the vertex linear arboricity
线性点荫度
1.
In the paper, we determined the vertex linear arboricity of complete multiple graphs and provided an upper bound for the vertex linear arboricity of Cartesian product graphs.
图的线性点荫度是对它的顶点进行染色所用的最少颜色数，同时使得染同一种颜色的点集所导出的子图，它的每个分支均为路。
4) the vertice linear arboricity of a graph
图的点线荫度
5) fractional vertex linear arboricity
分数点线性荫度
6) 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上的确切值。
补充资料：緑荫荫
1.见"緑阴阴"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条