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}
}
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

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Linear k - arboricities of trees

  • K. C. Huang
  • Discrete Appl . Math .
  • 1999

Critical point-arboritic graphs,

  • H. V. Kronk, J. Mitchem
  • J. London Math. Soc. vol
  • 1990

Z.-Z. Chen, “Efficient algorithms for acyclic colorings of graphs,

  • G. Chartrand, L. Lensniak, Graph, Digraphs, CA Wadsworth Monterey
  • Theor. Comput. Sci.,
  • 1981

A note on the vertex arboricity of a graph

  • E. F. Schmeichel
  • SIAM J . Discrete Math .
  • 1973

Similar Papers

Loading similar papers…