I. Akyildiz, X. Wang, and W. Wang, Wireless mesh networks: a survey, Computer Networks, vol.47, issue.4, pp.445-487, 2005.
DOI : 10.1016/j.comnet.2004.12.001

J. Bibb-cain, T. Billhartz, and L. Foore, A link scheduling and ad hoc networking approach using directional antennas, Military Communications Conference, 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

R. Klasing, N. Morales, and S. Pérennes, On the complexity of bandwidth allocation in radio networks, Theoretical Computer Science, vol.406, issue.3, pp.225-239, 2008.
DOI : 10.1016/j.tcs.2008.06.048
URL : https://hal.archives-ouvertes.fr/hal-00342875

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

H. Liu and B. Zhao, Optimal scheduling for link assignment in trafficsensitive STDMA wireless ad-hoc networks, Networking and Mobile Computing, ser, LNCS, vol.3619, pp.218-228, 2005.

C. Mcdiarmid, Discrete mathematics and radio channel assignment, Recent advances in algorithms and combinatorics, pp.27-63, 2003.

C. Molle, F. Peix, and H. Rivano, An optimization framework for the joint routing and scheduling in Wireless Mesh Networks, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, pp.1-5, 2008.
DOI : 10.1109/PIMRC.2008.4699718
URL : https://hal.archives-ouvertes.fr/hal-00429829

M. Padberg and M. Rao, -Matchings, Mathematics of Operations Research, vol.7, issue.1, pp.67-80, 1982.
DOI : 10.1287/moor.7.1.67
URL : https://hal.archives-ouvertes.fr/hal-00270767

B. Reed, Edge coloring near bipartite graphs, Operation Research Letters, pp.11-14, 1999.

E. Scheinerman and D. Ullman, Fractional Graph Theory: a rational approache to the theory of graphs, 1997.

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

H. G. Yeh and X. Zhu, Resource-sharing system scheduling and circular chromatic number, Theoretical Computer Science, vol.332, issue.1-3, pp.447-460, 2005.
DOI : 10.1016/j.tcs.2004.12.005