K. Aardal, S. Van-hoesel, A. Koster, C. Mannino, and A. Sassano, Models and solution techniques for frequency assignment problems, Annals of Operations Research, vol.19, issue.1???4, pp.79-129, 2007.
DOI : 10.1007/s10479-007-0178-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.9737

S. Alouf, E. Altman, J. Galtier, J. Lalande, and C. Touati, Quasioptimal bandwidth allocation for multi-spot MFTDMA satellites, IN- FOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp.560-571, 2005.
DOI : 10.1109/infcom.2005.1497923
URL : https://hal.archives-ouvertes.fr/inria-00451816

F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, Stochastic geometry and architecture of communication networks, Telecommunication Systems, vol.7, issue.1/3, pp.209-227, 1997.
DOI : 10.1023/A:1019172312328

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.
DOI : 10.1145/359094.359101

R. L. Brooks, On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, issue.02, pp.194-197, 1941.
DOI : 10.1017/S030500410002168X

R. Correa, F. Havet, and J. Sereni, About a Brooks-type theorem for improper colouring, Australasian Journal of Combinatorics, vol.43, pp.219-230, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00223009

L. Cowen, W. Goddard, and C. Jesurum, Defective coloring revisited, Journal of Graph Theory, vol.24, issue.3, pp.205-219, 1995.
DOI : 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.4522

L. J. Cowen, R. H. Cowen, and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.1, issue.2, pp.187-195, 1986.
DOI : 10.1002/jgt.3190100207

M. Fischetti, C. Lepschy, G. Minerva, G. Romanin-jacur, and E. Toto, Frequency assignment in mobile radio systems using branch-and-cut techniques, European Journal of Operational Research, vol.123, issue.2, pp.241-255, 2000.
DOI : 10.1016/S0377-2217(99)00254-4

P. Gupta and P. Kumar, The capacity of wireless networks. Information Theory, IEEE Transactions on, vol.46, issue.2, pp.388-404, 2000.

M. Haenggi, J. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, Stochastic geometry and random graphs for the analysis and design of wireless networks. Selected Areas in Communications, IEEE Journal on, vol.27, issue.7, pp.1029-1046, 2009.

F. Havet, B. Reed, and J. Sereni, L(2,1)-labelling of graphs, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '08, pp.621-630, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00486183

R. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

L. Lovász, On decompositions of graphs, Studia Sci. Math. Hungar, vol.1, pp.273-238, 1966.

C. Mannino and A. Sassano, An enumerative algorithm for the frequency assignment problem, Discrete Applied Mathematics, vol.129, issue.1, pp.155-169, 2003.
DOI : 10.1016/S0166-218X(02)00239-1
URL : http://doi.org/10.1016/s0166-218x(02)00239-1

D. R. Woodall, R. Nelson, and R. J. Wilson, Improper colorings of graphs, Longman Scientific and Technical, pp.45-63, 1990.

R. K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Mathematics, vol.306, issue.12, pp.1217-1231, 2006.
DOI : 10.1016/j.disc.2005.11.029
URL : http://doi.org/10.1016/j.disc.2005.11.029