K. I. Aardal, P. M. Stan, A. M. Van-hoesel, C. Koster, A. Mannino et al., Models and solution techniques for frequency assignment problems, Annals of Operations Research, vol.153, issue.1, pp.79-129, 2007.

J. Abello, P. Pardalos, and M. G. Resende, External memory algorithms, External Memory Algorithms, chapter On Maximum Clique Problems in Very Large Graphs, pp.119-130, 1999.

D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Graph partitioning and graph clustering, 2012.

I. Blöchliger and N. Zufferey, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Comput. Oper. Res, vol.35, issue.3, pp.960-975, 2008.

D. Brélaz, New Methods to Color the Vertices of a Graph, Commun. ACM, vol.22, issue.4, pp.251-256, 1979.

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins et al., Register allocation via coloring, Comput. Lang, vol.6, issue.1, pp.47-57, 1981.

D. Cornaz and V. Jost, A one-to-one correspondence between colorings and stable sets, Operations Research Letters, vol.36, issue.6, pp.673-676, 2008.

D. De and W. , An introduction to timetabling, European Journal of Operational Research, vol.19, issue.2, pp.151-162, 1985.

F. Furini, V. Gabrel, and I. Ternier, Lower bounding techniques for dsatur-based branch and bound, INOC 2015 -7th International Network Optimization Conference, vol.52, pp.149-156, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01337588

J. Hao and Q. Wu, Improving the extraction and expansion method for large graph coloring, Discrete Appl. Math, vol.160, pp.2397-2407, 2012.

E. Hebrard and G. Katsirelos, Clause Learning and New Bounds for Graph Coloring, Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming (CP-2018), pp.179-194, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01873500

A. Hertz and D. De-werra, Using tabu search techniques for graph coloring, Computing, vol.39, issue.4, pp.345-351, 1987.

, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, 1993.

T. Frank and . Leighton, A Graph Coloring Algorithm for Large Scheduling Problems, J. Res. Natl. Bur. Standards, vol.84, pp.489-506, 1979.

J. Leskovec and A. Krevl, SNAP Datasets: Stanford large network dataset collection, 2014.

J. Lin, S. Cai, C. Luo, and K. Su, A reduction based method for coloring very large graphs, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, pp.517-523, 2017.

L. Lovász, On the shannon capacity of a graph, IEEE Trans. Inf. Theor, vol.25, issue.1, pp.1-7, 2006.

E. Malaguti, M. Monaci, and P. Toth, An exact approach for the vertex coloring problem. Discrete Optimization, vol.8, pp.174-190, 2011.

W. David, L. L. Matula, and . Beck, Smallest-last ordering and clustering and graph coloring algorithms, J. ACM, vol.30, issue.3, pp.417-427, 1983.

A. Mehrotra and M. A. Trick, A column generation approach for graph coloring, INFORMS Journal on Computing, vol.8, pp.344-354, 1995.

L. Moalic and A. Gondran, Variations on memetic algorithms for graph coloring problems, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00925911

J. Mycielski, Sur le coloriage des graphes, In Colloq. Math, vol.3, pp.161-162, 1955.

T. Park and C. Y. Lee, Application of the graph coloring algorithm to the frequency assignment problem, Journal of the Operations Research society of Japan, vol.39, issue.2, pp.258-265, 1996.

A. Ryan, N. K. Rossi, and . Ahmed, Coloring large complex networks. CoRR, abs/1403, vol.3448, 2014.

B. Schaafsma, M. Heule, and H. Van-maaren, Dynamic Symmetry Breaking by Simulating Zykov Contraction, 12th International Conference on Theory and Applications of Satisfiability Testing (SAT-2009), pp.223-236, 2009.

P. San and S. , A new dsatur-based algorithm for exact vertex coloring, Operations Research, vol.39, issue.7, pp.1724-1733, 2012.

A. Van-gelder, Another Look at Graph Coloring via Propositional Satisfiability, Discrete Appl. Math, vol.156, issue.2, pp.230-243, 2008.

A. Verma, A. Buchanan, and S. Butenko, Solving the maximum clique and vertex coloring problems on very large sparse networks, INFORMS J. on Computing, vol.27, issue.1, pp.164-177, 2015.

J. L. Walteros and A. Buchanan, Why is maximum clique often easy in practice? Optimization Online, 2018.

Z. Zhou, C. Li, C. Huang, and R. Xu, An exact algorithm with learning for the graph coloring problem, Computers & Operations Research, vol.51, pp.282-301, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00999305