A star forest is a forest all of whose components are stars. The star arboricity, st(G) of a graph G is the minimum number of star forests whose union covers all the edges of G. The arboricity, A(G), of a graph G is the minimum number of forests whose union covers all the edges of G. Clearly st(G)≥A(G). In fact, Algor and Alon have given examples which show that in some cases st(G) can be as large as A(G)+Ω(logΔ) (where Δ is the maximum degree of a vertex in G). We show that for any graph G, st(G)≤A(G)+O(logΔ).
|Original language||English (US)|
|Number of pages||6|
|State||Published - Dec 1 1992|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics
- AMS subject classification code (1991): 05C70, 60C05