D. Angluin, Local and global properties in networks of processors, Proc. 12th ACM Symposium on Theory of Computation (STOC'81, pp.82-93, 1981.

H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, p.414, 2004.
DOI : 10.1002/0471478210

L. Barenboim and M. Elkin, Deterministic distributed vertex coloring in polylogarithmic time, Journal of the ACM, vol.58, issue.5, p.23, 2011.

L. Barenboim and M. Elkin, Distributed Graph Coloring: Fundamentals and Recent Developments, Synthesis Lectures on Distributed Computing Theory, vol.4, issue.1, p.155, 2014.
DOI : 10.2200/S00520ED1V01Y201307DCT011

L. Barenboim, M. Elkin, and F. Kuhn, Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time, SIAM Journal on Computing, vol.43, issue.1, pp.72-95, 2014.
DOI : 10.1137/12088848X

J. Blair and F. Manne, An efficient self-stabilizing distance-2 coloring algorithm, Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO'10), Springer LNCS 5869, pp.237-251, 2009.

D. Bozdag, U. V. Gebremedhin, A. H. Manne, F. Boman, E. G. et al., A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers, Proc. Int'l Conference on High Performance Computing and Communications (HPCC'05), Springer LNCS 3726, pp.796-806, 2005.
DOI : 10.1007/11557654_90

D. Bozdag, A. S. Gebremedhin, F. Manne, G. Boman, C. et al., A framework for scalable greedy coloring on distributed-memory parallel computers, Journal of Parallel and Distributed Computing, vol.68, issue.4, pp.515-535, 2008.
DOI : 10.1016/j.jpdc.2007.08.002

O. Chipara, C. Lu, J. Stankovic, and R. , Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries, IEEE Transactions on Mobile Computing, vol.10, issue.5, pp.734-748, 2011.
DOI : 10.1109/TMC.2010.209

R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, vol.70, issue.1, pp.32-53, 1986.
DOI : 10.1016/S0019-9958(86)80023-7

D. Frey, H. Lakhlef, and M. Raynal, Optimal Collision/Conflict-Free Distance-2 Coloring in Wireless Synchronous Broadcast/Receive Tree Networks, 2016 45th International Conference on Parallel Processing (ICPP), 2015.
DOI : 10.1109/ICPP.2016.47
URL : https://hal.archives-ouvertes.fr/hal-01396940

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, p.340, 1979.

A. H. Gebremedhin, F. Manne, and A. Pothen, Parallel Distance-k Coloring Algorithms for Numerical Optimization, Proc. European Conference on Parallel Processing (EUROPAR), Springer LNCS 2400, pp.912-921, 2002.
DOI : 10.1007/3-540-45706-2_130

A. Goldberg, S. Plotkin, and S. G. , Parallel Symmetry-Breaking in Sparse Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.434-446, 1988.
DOI : 10.1137/0401044

T. Herman and S. Tixeuil, A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks, Proc. Int'l Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'04), Springer LNCS 3121, pp.45-58, 2004.
DOI : 10.1007/978-3-540-27820-7_6

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, pp.7-15, 2006.
DOI : 10.1145/1146381.1146387

N. Linial, Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.
DOI : 10.1137/0221015

N. A. Lynch, Distributed algorithms, 1996.

D. Peleg, Distributed computing, a locally sensitive approach, SIAM Monographs on Discrete Mathematics and Applications, vol.343, 2000.

M. Raynal, Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049

M. Raynal, Distributed algorithms for message-passing systems
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219