In this paper, we discuss point arboricity of line graphs and obtain some bounds of point arboricity of line graphs.
文中讨论了线图的荫度，得到了线图荫度的若干界。
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.
这篇论文分为两部分，分别讨论了三正则图的列表线性荫度和线性可选性。
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
应用推荐