Vertex and tree arboricities of graphs

檔案

日期

2004-09-01

類型

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

卷期與頁次

第 8 卷第 3 期,頁 295–306

ISSN

1382-6905

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, G., Chen, C., & Chen, Y. (2004). Vertex and tree arboricities of graphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 8(3), 295–306. https://doi.org/10.1023/B:JOCO.0000038912.82046.17

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/26385