155
click to vote
CJCDGCGT
2005
Springer
15 years 7 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
121
Voted
CJCDGCGT
2005
Springer
15 years 11 months ago
2005
Springer
176
Voted
CJCDGCGT
2005
Springer
15 years 11 months ago
2005
Springer
155
Voted
CJCDGCGT
2005
Springer
15 years 11 months ago
2005
Springer
![A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III](https://sciweavers.org/files/imagecache/thumbnail/imagecache/a_neighborhood_condition_for_graphs_to_have_a_b_factors_iii_CJCDGCGT_2005.jpg "A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III")
