M. Garey and D. Johnson, Computers and intractability: a guide to theory of NP-completeness, 1979.

D. Brelaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, 1979.
DOI : 10.1145/359094.359101

J. Hansen, M. Kubale, L. Kuszner, and A. Nadolski, Distributed largest-first algorithm for graph coloring, EURO-PAR, 2004.

F. Kuhn and R. Wattenhofer, On the complexity of distributed graph coloring, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2006.
DOI : 10.1145/1146381.1146387

S. Gandham, M. Dawande, and R. Prakash, Link scheduling in sensor networks, Journal of Parallel and Distributed Computing, vol.68, issue.8, 2008.

R. Ramaswami and K. Parhi, Distributed scheduling of broadcasts in a radio network, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies, 1989.
DOI : 10.1109/INFCOM.1989.101493

S. Krumke, M. Marathe, and S. Ravi, Models and approximation algorithms for channel assignment in radio networks, Wireless Networks, vol.7, 2000.

K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, Impact of interference on multi-hop wireless network performance, Proceedings of the 9th annual international conference on Mobile computing and networking , MobiCom '03, 2003.
DOI : 10.1145/938985.938993

V. Rajendran, K. Obraczka, and J. Garcia-luna-aceves, Energy-efficient, collision-free medium access control for wireless sensor networks, Sensys'03, 2003.

I. Rhee, A. Warrier, and L. Xu, Randomized dining philosophers to TDMA scheduling in wireless sensor networks, 2005.

I. Rhee, A. Warrier, M. Aia, and J. Min, Z-MAC, Proceedings of the 3rd international conference on Embedded networked sensor systems , SenSys '05, 2005.
DOI : 10.1145/1098918.1098929

V. Rajendran, J. J. Garcia-luna-aceves, and K. Obraczka, Energy-efficient, application-aware medium access for sensor networks, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005., 2005.
DOI : 10.1109/MAHSS.2005.1542852

S. Gobriel, D. Mosse, and R. Cleric, TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism, 2009 29th IEEE International Conference on Distributed Computing Systems, 2009.
DOI : 10.1109/ICDCS.2009.80

J. Ma, W. Lou, Y. Wu, and X. Li, Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, 2009.
DOI : 10.1109/INFCOM.2009.5061970

P. Minet and S. Mahfoudh, SERENA: SchEduling RoutEr Nodes Activity in Wireless Ad Hoc and Sensor Networks, 2008 International Wireless Communications and Mobile Computing Conference, 2008.
DOI : 10.1109/IWCMC.2008.89
URL : https://hal.archives-ouvertes.fr/inria-00459528

G. Chakraborty, Genetic Algorithm to Solve Optimum TDMA Transmission Schedule in Broadcast Packet Radio Networks, IEEE Transactions on Communications, vol.52, issue.5, 2004.
DOI : 10.1109/TCOMM.2004.826234

W. L. Lee, A. Datta, and R. Cardell-oliver, FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.6, 2008.
DOI : 10.1109/TPDS.2007.70774

I. Cargiannis, A. Fishkin, C. Kaklamanis, and E. Papaioannou, A Tight Bound for Online Coloring of Disk Graphs, Theoretical Computer Science, vol.384, 2007.
DOI : 10.1007/11429647_8

]. A. Thue, ¨ Uber die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene, Norske Vid, Selsk. Skr, issue.1, pp.1-9, 1910.