We introduce the star number [tree number] of a graph, being the minim
um t such that G is the intersection graph of unions of t substars [su
btrees] of a host tree. We study bounds on these parameters, compare t
hem with interval number, and characterize the graphs with star number
1.