On an estimate of the chromatic class of a p-graph, Diskret. Analiz, vol.3, pp.23-30, 1964. ,
Computers and intractability: a guide to theory of NP-completeness, 1979. ,
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Mathematical Programming, vol.16, issue.2, pp.153-171, 1983. ,
DOI : 10.1007/BF02592052
Node coloring for dense wireless sensor networks, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00582457
Fast heuristics for the edge coloring of large graphs, Euromicro Symposium on Digital System Design, 2003. Proceedings., 2003. ,
DOI : 10.1109/DSD.2003.1231932
A survey of local search methods for graph coloring, Computers & Operations Research, vol.33, issue.9, pp.2547-2562, 2006. ,
DOI : 10.1016/j.cor.2005.07.028
Coloring large graphs based on independent set extraction, to appear in Computers and Operations Research, 2011. ,
A Tight Bound for Online Coloring of Disk Graphs, Theoretical Computer Science, vol.384, 2007. ,
DOI : 10.1007/11429647_8
Unit disk graphs, Discrete Mathematics, vol.86, pp.1-3, 1990. ,
IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS, Discrete Mathematics, Algorithms and Applications, vol.02, issue.03, pp.395-411, 2010. ,
DOI : 10.1142/S1793830910000747
Energy-efficient, collision-free medium access control for wireless sensor networks, Sensys'03, 2003. ,
Z-MAC, Proceedings of the 3rd international conference on Embedded networked sensor systems , SenSys '05, 2005. ,
DOI : 10.1145/1098918.1098929
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
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
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
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
A review of interference reduction in wireless networks using graph coloring methods, GRAPH-HOC, 2011. ,
Node Coloring and Color Conflict Detection in Wireless Sensor Networks, Future Internet, vol.2, issue.4, pp.469-504, 2010. ,
DOI : 10.3390/fi2040469
On the Probability of Khop Connection in Wireless Sensor Networks IEEE Communications Letters, pp.662-664, 2007. ,