S. Karen-i-aardal, . Hoesel, M. Arie, 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.

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.

M. Broes-de-cat, M. Denecker, P. Bruynooghe, and . Stuckey, Lazy model expansion: Interleaving grounding with search, Journal of Artificial Intelligence Research, vol.52, pp.235-286, 2015.

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, ACM Journal of Experimental Algorithmics, vol.18, issue.3, 2013.

D. Frost and R. Dechter, Look-ahead Value Ordering for Constraint Satisfaction Problems, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp.572-578, 1995.

C. Gomes, B. Selman, and H. Kautz, Boosting Combinatorial Search Through Randomization, Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-1998), pp.431-438, 1998.

J. Huang, The Effect of Restarts on the Efficiency of Clause Learning, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), 2007.

H. Jiang, C. Li, and F. Manyà, An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs, Proceedings of the 31st Conference on Artificial Intelligence (AAAI-2017), pp.830-838, 2017.

G. Katsirelos and F. Bacchus, Generalized Nogoods in CSPs, Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), pp.390-396, 2005.

D. R. Lick and T. Arthur, White. k-degenerate graphs, Canadian Journal of Mathematics, vol.22, pp.1082-1096, 1970.

J. Lin, S. Cai, C. Luo, and K. Su, A Reduction based Method for Coloring Very Large Graphs, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pp.517-523, 2017.
DOI : 10.24963/ijcai.2017/73
URL : https://www.ijcai.org/proceedings/2017/0073.pdf

J. P. Marques-silva and K. A. Sakallah, GRASP-a search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, issue.5, pp.506-521, 1999.
DOI : 10.1109/12.769433
URL : https://eprints.soton.ac.uk/262032/1/jpms-tcomp99.pdf

A. Mehrotra, . Michael, and . Trick, A column generation approach for graph coloring, INFORMS Journal on Computing, vol.8, issue.4, pp.344-354, 1996.
DOI : 10.1287/ijoc.8.4.344
URL : http://mat.gsia.cmu.edu/color.ps

M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an Efficient SAT Solver, Proceedings of the 39th Design Automation Conference (DAC-2001), pp.530-535, 2001.
DOI : 10.1109/dac.2001.935565
URL : http://www.cs.wm.edu/~idillig/cs780-02/chaff.pdf

J. Mycielski, Sur le coloriage des graphes, In Colloq. Math, vol.3, pp.161-162, 1955.
DOI : 10.4064/cm-3-2-161-162
URL : https://www.impan.pl/shop/publication/transaction/download/product/94136?download.pdf

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation = Lazy Clause Generation, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), pp.544-558, 2007.
DOI : 10.1007/978-3-540-74970-7_39
URL : http://www.cs.mu.oz.au/~pjs/papers/cp07a.pdf

T. Park and C. 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.

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.
DOI : 10.1007/978-3-642-02777-2_22
URL : http://www.st.ewi.tudelft.nl/~marijn/publications/Zykov_SAT2009.pdf

K. Stergiou, Heuristics for Dynamically Adapting Propagation, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-2008), pp.485-489, 2008.

, Computational Symposium on Graph Coloring and its Generalizations, 2002.

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

P. Van-hentenryck, P. Magnusågrenmagnusågren, J. Flener, and . Pearson, Tractable Symmetry Breaking for CSPs with Interchangeable Values, Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI2003), pp.277-282, 2003.

T. Walsh, Breaking Value Symmetry, Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-2008), pp.880-887, 2008.
DOI : 10.1007/978-3-540-74970-7_67
URL : http://www.cse.unsw.edu.au/~tw/wcp07.pdf

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

A. A. Zykov, On some properties of linear complexes, Mat. Sb, issue.66, pp.163-188, 1949.