1) List point arboricity
列表点荫度
1.
Firstly, we investigate the list point arboricity of total graphs, and conjecturethat [(Δ(G)+1)/2]≤ρ(T(G)) =ρ_l(T(G))≤[(Δ(G)+2/2] for any graph G.
本论文首先研究了全图的列表点荫度,提出猜想:对任意图G,有[(Δ(G)+1)/2]≤ρ(T(G)) =ρ_l(T(G))≤[(Δ(G)+2)/2],其中T(G)是图G的全图。
3) List linear arboricity
列表线性荫度
1.
The thesis is divided into two parts, which consist of some results on list linear arboricity of cubic graphs and linear choosability of cubic graphs, respectively.
这篇论文分为两部分,分别讨论了三正则图的列表线性荫度和线性可选性。
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) rertex linear arboricity
点线荫度
补充资料：緑荫荫
1.见"緑阴阴"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条