|
15.
ARBORICITY AND COMPLEMENT OF A GRAPH
王建方陈传平张忠辅
应用数学学报
1998, 21 (1):
0-0.
DOI: 10.12387/C1998013
The arboricity of graph G=(V,E), denoted by a(G), is defined as a(G)=min{n | E can be partitioned into n subsets E1,E2,...,En, such that each subset spans a subgraph of G so as to be a forest}.In this paper the following results have been obtain
相关文章 |
多维度评价
|
|