The Fractional Vertex Arboricity of Graphs

Roger Qing-lin Yu and Lian-cui Zuo
Center of Combinatorics, Nankai University,
Tianjin 300071, P.R. China
School of Science, Jinan University,
Jinan 250022, P.R. China

Abstract    
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The fractional version of the vertex arboricity for some classes graphs are determined.