M. T. Barlow, Diffusions on fractals, Lectures on probability theory and statistics, pp.1-121, 1995.
DOI : 10.1007/BFb0092537

B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, vol.184, 1998.
DOI : 10.1007/978-1-4612-0619-4

S. Chang and L. Chen, Spanning forests on the Sierpinski gasket. preprint, arXiv:math- ph/0612083v1, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00972319

S. Chang and L. Chen, Dimer Coverings on the Sierpinski Gasket, Journal of Statistical Physics, vol.152, issue.4, pp.631-650, 2008.
DOI : 10.1007/s10955-008-9516-0

S. Chang and L. Chen, Dimer-monomer model on the Sierpinski gasket, Physica A: Statistical Mechanics and its Applications, vol.387, issue.7, pp.1551-1566, 2008.
DOI : 10.1016/j.physa.2007.10.057

S. Chang, L. Chen, and W. Yang, Spanning Trees on the Sierpinski Gasket, Journal of Statistical Physics, vol.36, issue.3, pp.649-667, 2007.
DOI : 10.1007/s10955-006-9262-0
URL : https://hal.archives-ouvertes.fr/hal-00993549

P. G. Doyle and J. L. Snell, Random walks and electric networks Also available at arXiv.org as math, Carus Mathematical Monographs. Mathematical Association of America, vol.22, 1057.
DOI : 10.5948/upo9781614440222
URL : http://arxiv.org/abs/math/0001057

J. Kigami, Analysis on fractals, volume 143 of Cambridge Tracts in Mathematics, 2001.

G. R. Kirchhoff, ¨ Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem, vol.72, issue.4, pp.497-508, 1847.

B. Krön, Growth of Self-Similar Graphs, Journal of Graph Theory, vol.8, issue.1, pp.224-239, 2004.
DOI : 10.1002/jgt.10157

L. A. Malozemov, The difference Laplacian ? on the modified Koch curve, Russian J. Math. Phys, vol.1, issue.4, pp.495-509, 1993.

V. Metz, The short-cut test, Journal of Functional Analysis, vol.220, issue.1, pp.118-156, 2005.
DOI : 10.1016/j.jfa.2004.06.008

A. D. Sokal, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, Surveys in combinatorics 2005, pp.173-226, 2005.
DOI : 10.1017/CBO9780511734885.009

E. Teufl and S. Wagner, The number of spanning trees of finite sierpinski graphs, Fourth Colloquium on Mathematics and Computer Science, volume AG of DMTCS Proceedings, pp.411-414, 2006.

E. Teufl and S. Wagner, Enumeration problems for classes of self-similar graphs, Journal of Combinatorial Theory, Series A, vol.114, issue.7, pp.1254-1277, 2007.
DOI : 10.1016/j.jcta.2007.01.007

E. Teufl and S. Wagner, The number of spanning trees in self-similar graphs. preprint, 2008.