Weighted improper colouring

Aardal, 2007, Models and solution techniques for frequency assignment problems, Annals of Operations Research, 153, 79, 10.1007/s10479-007-0178-0 Alouf, 2005, Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites, vol. 1, 560 J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski, Weighted improper colouring, Research Report RR-7590, INRIA, 2011. Baccelli, 1997, Stochastic geometry and architecture of communication networks, Telecom. Systems, 7, 209, 10.1023/A:1019172312328 Brélaz, 1979, New methods to color the vertices of a graph, Communications of the ACM, 22, 251, 10.1145/359094.359101 Brooks, 1941, On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, 37, 194, 10.1017/S030500410002168X Correa, 2009, About a Brooks-type theorem for improper colouring, Australasian Journal of Combinatorics, 43, 219 Cowen, 1986, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, 10, 187, 10.1002/jgt.3190100207 Cowen, 1995, Defective coloring revisited, Journal of Graph Theory, 24, 205, 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T Fischetti, 2000, Frequency assignment in mobile radio systems using branch-and-cut techniques, European Journal of Operational Research, 123, 241, 10.1016/S0377-2217(99)00254-4 Gupta, 2000, The capacity of wireless networks, IEEE Transactions on Information Theory, 46, 388, 10.1109/18.825799 Haenggi, 2009, Stochastic geometry and random graphs for the analysis and design of wireless networks, IEEE Journal on Selected Areas in Communications, 27, 1029, 10.1109/JSAC.2009.090902 Havet, 2008, L(2,1)-labelling of graphs, 621 Karp, 1972, Reducibility among combinatorial problems, 85 Lovász, 1966, On decompositions of graphs, Studia Sci. Math. Hungar., 1, 238 Mannino, 2003, An enumerative algorithm for the frequency assignment problem, Discrete Applied Mathematics, 129, 155, 10.1016/S0166-218X(02)00239-1 Woodall, 1990, Improper colorings of graphs, vol. 218, 45 Yeh, 2006, A survey on labeling graphs with a condition at distance two, Discrete Mathematics, 306, 1217, 10.1016/j.disc.2005.11.029