G. E. Andrews, The theory of partitions, 1984.
DOI : 10.1017/CBO9780511608650

R. P. Anstee-and-m and . Farber, Characterizations of totally balanced matrices, Journal of Algorithms, vol.5, issue.2, pp.215-230, 1984.
DOI : 10.1016/0196-6774(84)90028-2

A. Barvinok, Enumerating Contingency Tables via Random Permanents, Combinatorics, Probability and Computing, vol.35, issue.01, pp.1-19, 2008.
DOI : 10.1007/s004930070007

A. Bj¨oklundbj¨-bj¨oklund, T. Husfeldt, P. Kaski, and A. M. Koivisto, Computing the Tutte polynomial in vertex-exponential time, Proc. of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp.677-686, 2008.

G. Farr and C. Mcdiarmid, The complexity of counting homeomorphs, Theoretical Computer Science, vol.36, pp.345-348, 1985.
DOI : 10.1016/0304-3975(85)90053-2

T. Granlund and A. , GNU multiple precision arithmetic library

Y. , J. And-c, and . Liu, The enumeration of labelled spanning trees of K m,n , Australas, J. Combin, vol.28, pp.73-79, 2003.

C. J. Liu and Y. Chow, Enumeration of forests in a graph, Proc. Amer, pp.659-662, 1981.
DOI : 10.1090/S0002-9939-1981-0627715-2

W. Myrvold, Counting k-component forests of a graph, pp.22-647, 1992.

T. Porter, Generating the list of spanning trees in K s,t, J. Combin. Math. Combin. Comput, vol.50, pp.17-32, 2004.

L. A. Székelysz´székely, Counting rooted spanning forests in complete multipartite graphs, Ars Combin, p.73, 2004.

Y. Teranishi, The number of spanning forests of a graph, Discrete Mathematics, vol.290, issue.2-3, pp.259-267, 2005.
DOI : 10.1016/j.disc.2004.10.014