【摘要】 该文讨论了无爪图的顶点划分数,给出了完全n部图的顶点划分数的计算公式,最后证明了任意图的点线荫度不大于它的边线荫度且不等式是精确的.更多还原

【Abstract】 :In this paper, the vertex partition number of a claw-free graph is studied, the formula for vertex partition of a complete n-partition graph will be obtained, finally,it is proved that the vertex linear arboricity of a graph is not greater than its edge linear arboricity and the inequality is sharp.更多还原