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

O. Amini, F. Havet, F. Huc, and S. Thomassé, WDM and Directed Star Arboricity, Combinatorics, Probability and Computing, vol.41, issue.02, pp.161-182, 2010.
DOI : 10.1016/0012-365X(89)90073-3
URL : https://hal.archives-ouvertes.fr/inria-00132396

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

R. Downey and M. Fellows, Fixed-Parameter Tractability and Completeness I: Basic Results, SIAM Journal on Computing, vol.24, issue.4, pp.873-921, 1995.
DOI : 10.1137/S0097539792228228

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

L. Lovász, A note on factor-critical graphs, Studia Sci. Math. Hungar, vol.7, pp.279-280, 1972.

W. Mccuaig, Pólya's permanent problem, Electron, Research Paper 79, p.pp. (electronic)

N. Robertson, P. D. Seymour, and R. Thomas, Permanents, Pfaffian Orientations, and Even Directed Circuits, The Annals of Mathematics, vol.150, issue.3, pp.929-975, 1999.
DOI : 10.2307/121059

C. Thomassen, Even Cycles in Directed Graphs, European Journal of Combinatorics, vol.6, issue.1, pp.85-89, 1985.
DOI : 10.1016/S0195-6698(85)80025-1

V. G. Vizing, On an estimate of the chromatic class of a p-graph, Metody Diskret. Analyz, vol.3, pp.25-30, 1964.