C. Bessì-ere, P. Meseguer, E. C. Freuder, and J. Larrosa, On forward checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, issue.1-2, pp.205-224, 2002.
DOI : 10.1016/S0004-3702(02)00263-1

A. Chmeiss and P. Jégou, A generalization of chordal graphs and the maximum clique problem, Information Processing Letters, vol.62, issue.2, pp.111-120, 1997.
DOI : 10.1016/S0020-0190(97)00044-6

A. David and . Cohen, A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure, Proceedings of CP 2003, pp.807-811, 2003.

M. Cooper, D. Cohen, and P. Jeavons, Characterising tractable constraints, Artificial Intelligence, vol.65, issue.2, pp.347-361, 1994.
DOI : 10.1016/0004-3702(94)90021-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.80

M. Cooper, P. Jeavons, and A. Salamon, Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artificial Intelligence, vol.174, issue.9-10, pp.570-584, 2010.
DOI : 10.1016/j.artint.2010.03.002

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989.
DOI : 10.1016/0004-3702(89)90037-4

V. Dujmovic, G. Fijavz, G. Joret, T. Sulanke, and D. R. Wood, On the maximum number of cliques in a graph embedded in a surface, European Journal of Combinatorics, vol.32, issue.8, pp.321244-1252, 2011.
DOI : 10.1016/j.ejc.2011.04.001

E. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.
DOI : 10.1145/322290.322292

M. Golumbic, G. Gottlob, N. Leone, and F. Scarcello, Algorithmic Graph Theory and Perfect Graphs, A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, vol.124, pp.343-282, 1980.

R. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

P. Jégou, Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems, Proceedings of AAAI 93, pp.731-736, 1993.

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

A. Rauzy, Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure?, Proc. International Conference on Principles of Constraint Programming, pp.515-532, 1995.
DOI : 10.1007/3-540-60299-2_31

B. Rosgen and L. Stewart, Complexity results on graphs with few cliques, Discrete Mathematics and Theoretical Computer Science, vol.9, pp.127-136, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00966509

F. Rossi, C. Petrie, and V. Dhar, On the equivalence of constraint satisfaction problems, Proceedings of the 9th European Conference on Artificial Intelligence, pp.550-556, 1990.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming, 2006.

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proc. of ECAI, pp.125-129, 1994.
DOI : 10.1007/3-540-58601-6_86

R. David and . Wood, On the maximum number of cliques in a graph, Graphs and Combinatorics, vol.23, pp.337-352, 2007.