图的点荫度和点线性荫度.pptVIP

图的点荫度和点线性荫度 马刚 山东大学数学院 The vertex arboricity va(G) of a graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces a forest of G. The vertex linear arboricity vla(G) of a graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces linear forest of G. For any graph G, Theorem (Kronk and Mitchem, 1975) Let G be a simple connected graph. If G neither a cycle nor a clique of odd order, then Theorem (Matsumoto,1990) Let G b