I. Algor and N. Alon, The star arboricity of graphs, Discrete Mathematics, vol.75, issue.1-3, pp.11-22, 1989.
DOI : 10.1016/0012-365X(89)90073-3

N. Alon, C. Mcdiarmid, and B. Reed, Star arboricity, Combinatorica, vol.39, issue.4, pp.375-380, 1992.
DOI : 10.1007/BF01305230

R. Brandt, Multicasting using WDM in Multifiber Optical Star Networks, 2003.

R. Brandt and T. F. Gonzalez, WAVELENGTH ASSIGNMENT IN MULTIFIBER OPTICAL STAR NETWORKS UNDER THE MULTICASTING COMMUNICATION MODE, Journal of Interconnection Networks, vol.06, issue.04, pp.383-405, 2005.
DOI : 10.1142/S0219265905001484

A. Frank, Covering branchings, Acta Sci. Math. (Szeged), vol.41, pp.77-81, 1979.

B. Guiduli, On incidence coloring and star arboricity of graphs, Discrete Mathematics, vol.163, issue.1-3, pp.275-278, 1997.
DOI : 10.1016/0012-365X(95)00342-T

A. Lardies, R. Gupta, and R. Patterson, Traffic grooming in a multi-layer network, Opt. Netw. Mag, vol.2, pp.91-99, 2001.

E. Modiano and P. J. Lin, Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001.
DOI : 10.1109/35.933446

A. Pinlou and E. Sopena, The acircuitic directed star arboricity of subcubic graphs is at most four, Discrete Mathematics, vol.306, issue.24
DOI : 10.1016/j.disc.2006.06.007

URL : https://hal.archives-ouvertes.fr/hal-00307095

A. Schrijver, Combinatorial optimization. Polyhedra and efficiency, Algorithms and Combinatorics, vol.24, 2003.