Vertex and Tree Arboricities of Graphs
摘要：
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 block-cactus graphs, series-parallel graphs, cographs and planar graphs.
展开
关键词：
arboricity acyclic tree block-cactus graph series-parallel graph cograph girth planar graph hamiltonian cycle
DOI：
10.1023/B:JOCO.0000038912.82046.17
被引量：
年份：
2004
通过文献互助平台发起求助，成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
来源期刊
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
