Fractional Vertex Arboricity of Graphs

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 is introduced in this paper. We determine the fractional vertex arboricity for several classes of graphs, e.g., complete multipartite graphs, cycles, integer distance graphs, prisms and Peterson graphs. Keywords vertex arboricity; tree coloring; fractional vertex arboricity; fractional tree coloring

• Type: Conference
• Year: 2005
• Where: CJCDGCGT
• Authors: Qinglin Yu, Lian-Cui Zuo
• Keywords: CJCDGCGT 2005, Discrete Geometry, Fractional Vertex Arboricity, Keywords Vertex Arboricity, Vertex Arboricity