【摘要】 图的线性点荫度是对它的顶点进行染色所用的最少颜色数，同时使得染同一种颜色的点集所导出的子图，它的每个分支均为路．本文完全确定了完全多部图的线性点荫度，给出了笛卡儿积图的线性点荫度的一个上界，得到了一些特殊图（ 如路，圈和完全图） 的笛卡儿积图的线性点荫度．更多还原

【Abstract】 The vertex linear arboricity of graph G is the least number of colors with which V(G) can be colored such that each subset of vertices received same color induces a subgraph whose connected components are paths. 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.更多还原