H. Chen and V. Dalmau, (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability, Lecture Notes in Computer Science, vol.3258, pp.182-196, 2004.
DOI : 10.1007/978-3-540-30201-8_16

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

D. A. 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, Hybrid tractable CSPs which generalize tree structure, Proceedings of ECAI 2008, pp.530-534, 2008.

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

URL : http://doi.org/10.1016/j.artint.2010.03.002

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, Algorithmic Graph Theory and Perfect Graphs, 1980.

G. Gottlob, N. Leone, and F. Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.343-282, 2000.
DOI : 10.1016/S0004-3702(00)00078-3

R. Haralick, E. , and G. , 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

B. Nadel, Tree Search and ARC Consistency in Constraint Satisfaction Algorithms, Search in Artificial Intelligence, pp.287-342, 1988.
DOI : 10.1007/978-1-4613-8788-6_9

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, 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

A. Salamon and P. Jeavons, Perfect Constraints Are Tractable, Proceedings of CP, pp.524-528, 2008.
DOI : 10.1007/978-3-540-85958-1_35

D. R. Wood, On the Maximum Number of Cliques in a Graph, Graphs and Combinatorics, vol.23, issue.3, pp.337-352, 2007.
DOI : 10.1007/s00373-007-0738-8