J. Bibb-cain, T. Billhartz, and L. , Foore A link scheduling and ad hoc networking approach using directional antennas, Military comm. conf, pp.643-648, 2003.

R. C. Carlson and G. L. Nemhauser, Scheduling to Minimize Interaction Cost, Operations Research, vol.14, issue.1, pp.52-58, 1966.
DOI : 10.1287/opre.14.1.52

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.718-720, 1981.
DOI : 10.1137/0210055

D. P. Koreas, The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3, Applied Mathematics and Computation, vol.83, issue.1, pp.13-17, 1997.
DOI : 10.1016/S0096-3003(96)00021-5

C. Mcdiarmid, Discrete Mathematics and Radio Channel Assignment, Linhares-Sales, pp.27-63, 2003.
DOI : 10.1007/0-387-22444-0_2

G. L. Nemhauser and S. Park, A polyhedral approach to edge coloring, Operations Research Letters, vol.10, issue.6, pp.315-322, 1991.
DOI : 10.1016/0167-6377(91)90003-8

V. G. Vizing, On an estimate of a chromatic class of a p-graph (In Russian), Diskret, Analiz, vol.3, pp.25-30, 1964.