Highly Influenced

# Vertex and Tree Arboricities of Graphs

@article{Chang2004VertexAT, title={Vertex and Tree Arboricities of Graphs}, author={Gerard J. Chang and Chiuyuan Chen and Yaping Chen}, journal={J. Comb. Optim.}, year={2004}, volume={8}, pages={295-306} }

- Published 2004 in J. Comb. Optim.
DOI:10.1023/B:JOCO.0000038912.82046.17

This paper studies the following variations of arboricity of graphs. The vertex (respectively, tree) arboricity of a graph G is the minimum number va(G) (respectively, ta(G)) of subsets into which the vertices of G can be partitioned so that each subset induces a forest (respectively, tree). This paper studies the vertex and the tree arboricities on various classes of graphs for exact values, algorithms, bounds, hamiltonicity and NP-completeness. The graphs investigated in this paper include… CONTINUE READING