1. Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial: a new graph polynomial. In: SODA, pp. 237–245. Society for Industrial and Applied Mathematics (2000)
2. Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Counting graph homomorphisms. In: Klazar, M., Kratochvíl, J., Loebl, M., Matous̆ek, J., Valtr, P., Thomas, R. (eds.) Topics in Discrete Mathematics, volume 26 of Algorithms and Combinatorics, pp. 315–371. Springer, Berlin (2006)
3. Brylawski, T., Oxley, J.: The Tutte polynomial and its applications. In: White, N. (ed.) Matriod Applications, pp. 123–225. Cambridge University Press, Cambridge (1992)
4. Bulatov, A., Dyer, M., Ann Goldberg, L., Jalsenius, M., Richerby, D.: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38–40), 3949–3961 (2009)
5. Bulatov, A., Grohe, M.: The complexity of partition functions. Theor. Comput. Sci. 348(2), 148–186 (2005)