ISSN:
1439-6912
Keywords:
05 C 70
;
60 C 05
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Astar forest is a forest all of whose components are stars. Thestar arboricity, st(G) of a graphG is the minimum number of star forests whose union covers all the edges ofG. Thearboricity, A(G), of a graphG is the minimum number of forests whose union covers all the edges ofG. Clearlyst(G)≥A(G). In fact, Algor and Alon have given examples which show that in some casesst(G) can be as large asA(G)+Ω(logΔ) (where Δ is the maximum degree of a vertex inG). We show that for any graphG, st(G)≤A(G)+O(logΔ).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01305230
Permalink