L. Barto, M. Kozik, and T. Niven, Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, 2008.
DOI : 10.1145/1374376.1374488

M. Bläser and H. Dell, Complexity of the Cover Polynomial, of the 34th International Colloquium on Automata, Languages and Programming, pp.801-812, 2007.
DOI : 10.1007/978-3-540-73420-8_69

A. Bulatov, A dichotomy theorem for constraint satisfaction problems on a 3-element set, Journal of the ACM, vol.53, issue.1, pp.66-120, 2006.
DOI : 10.1145/1120582.1120584

A. Bulatov, The complexity of the counting constraint satisfaction problem, Proceedings of the 35th International Colloquium on Automata, Languages and Programming, 2008.

A. Bulatov and V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp.562-571, 2003.

A. Bulatov and M. Grohe, The complexity of partition functions, Theoretical Computer Science, vol.348, issue.2-3, pp.148-186, 2005.
DOI : 10.1016/j.tcs.2005.09.011

M. Dyer and C. Greenhill, The complexity of counting graph homomorphisms. Random Structures and Algorithms, pp.3-4260, 2000.

M. E. Dyer, L. A. Goldberg, and M. Paterson, On counting homomorphisms to directed acyclic graphs, Journal of the ACM, vol.54, issue.6, 2007.
DOI : 10.1145/1314690.1314691
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.9264

A. Ehrenfeucht and M. Karpinski, The computational complexity of (xor, and )-counting problems, 1990.

M. Freedman, L. Lovász, and A. Schrijver, Reflection positivity, rank connectivity, and homomorphism of graphs, Journal of the American Mathematical Society, vol.20, issue.01, pp.37-51, 2007.
DOI : 10.1090/S0894-0347-06-00529-7

L. A. Goldberg, S. Kelk, and M. Paterson, -colouring (nearly) uniformly at random, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.53-62, 2002.
DOI : 10.1145/509907.509917
URL : https://hal.archives-ouvertes.fr/hal-00018506

L. A. Goldberg and M. Jerrum, Inapproximability of the tutte polynomial, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp.459-468, 2007.

P. Hell and J. Ne?et?il, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B, vol.48, issue.1, pp.92-110, 1990.
DOI : 10.1016/0095-8956(90)90132-J

F. Jaeger, D. L. Vertigan, and D. J. Welsh, On the computational complexity of the Jones and Tutte polynomials, Mathematical Proceedings of the Cambridge Philosophical Society, vol.99, issue.01, pp.35-53, 1990.
DOI : 10.1016/0304-3975(79)90044-6

R. Lidl and H. Niederreiter, Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications, 1997.

M. Lotz and J. A. Makowsky, On the algebraic complexity of some families of coloured Tutte polynomials, Advances in Applied Mathematics, vol.32, issue.1-2, pp.327-349, 2004.
DOI : 10.1016/S0196-8858(03)00087-3

L. Lovász, The rank of connection matrices and the dimension of graph algebras, European Journal of Combinatorics, vol.27, issue.6, pp.962-970, 2006.
DOI : 10.1016/j.ejc.2005.04.012

L. Lovász and A. Schrijver, Graph parameters and semigroup functions, European Journal of Combinatorics, vol.29, issue.4
DOI : 10.1016/j.ejc.2007.11.008

A. Sokal, The multivariate Tutte polynomial, Surveys in Combinatorics, 2005.

D. J. Welsh, Complexity: Knots, Colourings and Counting, 1993.
DOI : 10.1017/CBO9780511752506