W. W. Adams and P. Loustaunau, An introduction to Gröbner bases, Graduate Studies in Mathematics, vol.3, 1994.

T. Feder and S. M. Shende, Online channel allocation in FDMA networks with reuse constraints, Information Processing Letters, vol.67, issue.6, pp.295-302, 1998.
DOI : 10.1016/S0020-0190(98)00126-4

H. Grötzsch, Ein dreifarbensatz fur dreikreisfreie netze auf der kuzel, Wiss. Z. Martin-Luther Univ

M. M. Halldórsson and G. Kortsarz, Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees, Journal of Algorithms, vol.42, issue.2, pp.334-366, 2002.
DOI : 10.1006/jagm.2001.1210

J. Janssen, K. Kilakos, and O. Marcotte, Fixed preference channel assignment for cellular telephone systems, IEEE Transactions on Vehicular Technology, vol.48, issue.2, pp.533-541, 1999.
DOI : 10.1109/25.752578

S. Jordan and E. J. Schwabe, Worst-case preference of cellular channel assignment policies, Wireless networks, pp.265-275, 1996.

M. Kchikech and O. Togni, Paths Coloring Algorithms in Mesh Networks, Fourth International Conference on Discrete Mathematics and theorical Computer Science (DMTCS'03), pp.193-202, 2003.
DOI : 10.1007/3-540-45066-1_15

M. Kchikech and O. Togni, Multicoloring and Wavelength Assignment in WDM all-optical Networks, 2nd International Conference on Information Technology (ICIT'05), 2005.

L. Kowalik, Fast 3-Coloring Triangle-Free Planar Graphs, 12th Annual European Symposium (ESA'04), pp.436-447, 2004.
DOI : 10.1007/978-3-540-30140-0_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.5116

C. Mcdiarmid and B. Reed, Channel assignment and weighted coloring, Networks, vol.29, issue.2, pp.114-117, 2000.
DOI : 10.1002/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G

Y. Miyamoto and T. Matsui, Linear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals, Journal of the Operations Research Society of Japan, vol.47, issue.2, pp.123-128, 2004.

L. Narayanan and S. M. Shende, Static Frequency Assignment in Cellular Networks, Algorithmica, vol.29, issue.3, pp.396-409, 2001.
DOI : 10.1007/s004530010067

L. Narayanan and Y. Tang, Worst-case analysis of a dynamic channel assignment strategy, Discrete Applied Mathematics, vol.140, issue.1-3, pp.115-141, 2004.
DOI : 10.1016/j.dam.2003.02.002

C. Nomikos, A. Pagourtzis, and S. Zachos, Routing and path multicoloring, Information Processing Letters, vol.80, issue.5, pp.249-256, 2001.
DOI : 10.1016/S0020-0190(01)00167-3
URL : http://dspace.lib.ntua.gr/handle/123456789/14334

N. Robertson, D. Sanders, P. Seymour, and R. Thomas, The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997.
DOI : 10.1006/jctb.1997.1750