1.

Addario-Berry, L., Broutin, N. and Goldschmidt, C. (2012). The continuum limit of critical random graphs. Probab. Theory Related Fields 152 367–406.  10.1007/s00440-010-0325-4 MR2892951Addario-Berry, L., Broutin, N. and Goldschmidt, C. (2012). The continuum limit of critical random graphs. Probab. Theory Related Fields 152 367–406.  10.1007/s00440-010-0325-4 MR2892951

2.

Addario-Berry, L., Broutin, N., Goldschmidt, C. and Miermont, G. (2017). The scaling limit of the minimum spanning tree of the complete graph. Ann. Probab. 45 3075–3144.  10.1214/16-AOP1132 MR3706739Addario-Berry, L., Broutin, N., Goldschmidt, C. and Miermont, G. (2017). The scaling limit of the minimum spanning tree of the complete graph. Ann. Probab. 45 3075–3144.  10.1214/16-AOP1132 MR3706739

3.

Addario-Berry, L., Broutin, N. and Holmgren, C. (2014). Cutting down trees with a Markov chainsaw. Ann. Appl. Probab. 24 2297–2339.  10.1214/13-AAP978 MR3262504Addario-Berry, L., Broutin, N. and Holmgren, C. (2014). Cutting down trees with a Markov chainsaw. Ann. Appl. Probab. 24 2297–2339.  10.1214/13-AAP978 MR3262504

4.

Aldous, D. (1990). The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics 3 450–465.  MR1069105Aldous, D. (1990). The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics 3 450–465.  MR1069105

5.

Aldous, D. (1991). Asymptotic fringe distributions for general families of random trees. The Annals of Applied Probability 1 228–266.  10.1214/aoap/1177005936 MR1102319Aldous, D. (1991). Asymptotic fringe distributions for general families of random trees. The Annals of Applied Probability 1 228–266.  10.1214/aoap/1177005936 MR1102319

6.

Aldous, D. (1997). Brownian excursions, critical random graphs and the multiplicative coalescent. The Annals of Probability 25 812–854.  10.1214/aop/1024404421 MR1434128Aldous, D. (1997). Brownian excursions, critical random graphs and the multiplicative coalescent. The Annals of Probability 25 812–854.  10.1214/aop/1024404421 MR1434128

7.

Aldous, D. and Pitman, J. (1998). The standard additive coalescent. Ann. Probab. 26 1703–1726.  10.1214/aop/1022855879 MR1675063Aldous, D. and Pitman, J. (1998). The standard additive coalescent. Ann. Probab. 26 1703–1726.  10.1214/aop/1022855879 MR1675063

8.

Annan, J. D. (1994). A randomised approximation algorithm for counting the number of forests in dense graphs. Combin. Probab. Comput. 3 273–283.  10.1017/S0963548300001188 MR1300965Annan, J. D. (1994). A randomised approximation algorithm for counting the number of forests in dense graphs. Combin. Probab. Comput. 3 273–283.  10.1017/S0963548300001188 MR1300965

9.

Auffinger, A., Damron, M. and Hanson, J. (2017). 50 Years of First-Passage Percolation. University Lecture Series. American Mathematical Society, Providence, RI.  MR3729447Auffinger, A., Damron, M. and Hanson, J. (2017). 50 Years of First-Passage Percolation. University Lecture Series. American Mathematical Society, Providence, RI.  MR3729447

10.

Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (2001). Uniform spanning forests. Ann. Probab. 29 1–65.  10.1214/aop/1008956321 MR1825141~(2003a:60015)Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (2001). Uniform spanning forests. Ann. Probab. 29 1–65.  10.1214/aop/1008956321 MR1825141~(2003a:60015)

11.

Bentz, C., Costa, M.-C. and Hertz, A. (2020). On the edge capacitated Steiner tree problem. Discrete Optimization 38 100607.  10.1016/j.disopt.2020.100607 MR4139097Bentz, C., Costa, M.-C. and Hertz, A. (2020). On the edge capacitated Steiner tree problem. Discrete Optimization 38 100607.  10.1016/j.disopt.2020.100607 MR4139097

12.

Bergeron, F., Flajolet, P. and Salvy, B. (1992). Varieties of increasing trees. In CAAP ’92 (J. C. Raoult, ed.) 24–48. Springer Berlin Heidelberg, Berlin, Heidelberg.Bergeron, F., Flajolet, P. and Salvy, B. (1992). Varieties of increasing trees. In CAAP ’92 (J. C. Raoult, ed.) 24–48. Springer Berlin Heidelberg, Berlin, Heidelberg.

13.

Bernardi, O. (2008). A characterization of the Tutte polynomial via combinatorial embeddings. Annals of Combinatorics 12 139–153.  MR2428901Bernardi, O. (2008). A characterization of the Tutte polynomial via combinatorial embeddings. Annals of Combinatorics 12 139–153.  MR2428901

14.

Bertoin, J. and Miermont, G. (2013). The cut-tree of large Galton–Watson trees and the Brownian CRT. The Annals of Applied Probability 23 1469–1493.  10.1214/12-AAP877 MR3098439Bertoin, J. and Miermont, G. (2013). The cut-tree of large Galton–Watson trees and the Brownian CRT. The Annals of Applied Probability 23 1469–1493.  10.1214/12-AAP877 MR3098439

15.

Bondy, J. and Murty, U. (2008). Graph Theory, 1st ed. Springer.  MR2368647Bondy, J. and Murty, U. (2008). Graph Theory, 1st ed. Springer.  MR2368647

16.

uvka, O. B. (1926). O jistém problému minimálním. Práce Mor. Přírodověd. Spol. v Brně III, vol. 3.uvka, O. B. (1926). O jistém problému minimálním. Práce Mor. Přírodověd. Spol. v Brně III, vol. 3.

17.

Botet, R. and Jullien, R. (1985). Diffusion-limited aggregation with disaggregation. Physical Review Letters 55 1943.Botet, R. and Jullien, R. (1985). Diffusion-limited aggregation with disaggregation. Physical Review Letters 55 1943.

18.

Broder, A. (1989). Generating random spanning trees. In FOCS, 89 442–447.Broder, A. (1989). Generating random spanning trees. In FOCS, 89 442–447.

19.

Broutin, N., Devroye, L., McLeish, E. and de la Salle, M. (2008). The height of increasing trees. Random Structures Algorithms 32 494–518.  10.1002/rsa.20202 MR2422392Broutin, N., Devroye, L., McLeish, E. and de la Salle, M. (2008). The height of increasing trees. Random Structures Algorithms 32 494–518.  10.1002/rsa.20202 MR2422392

20.

Broutin, N. and Marckert, J.-F. (2014). Asymptotics of trees with a prescribed degree sequence and applications. Random Structures Algorithms 44 290–316.  10.1002/rsa.20463 MR3188597Broutin, N. and Marckert, J.-F. (2014). Asymptotics of trees with a prescribed degree sequence and applications. Random Structures Algorithms 44 290–316.  10.1002/rsa.20463 MR3188597

21.

Broutin, N. and Marckert, J.-F. (2016). A new encoding of coalescent processes. Applications to the additive and multiplicative cases. Probability Theory and Related Fields 166 515–552.  10.1007/s00440-015-0665-1 MR3547745Broutin, N. and Marckert, J.-F. (2016). A new encoding of coalescent processes. Applications to the additive and multiplicative cases. Probability Theory and Related Fields 166 515–552.  10.1007/s00440-015-0665-1 MR3547745

22.

Broutin, N. and Marckert, J.-F. (2023). Convex minorant trees associated with Brownian paths and the continuum limit of the minimum spanning tree.Broutin, N. and Marckert, J.-F. (2023). Convex minorant trees associated with Brownian paths and the continuum limit of the minimum spanning tree.

23.

Broutin, N. and Wang, M. (2017). Reversing the cut tree of the Brownian continuum random tree. Electron. J. Probab. 22 Paper No. 80, 23.  10.1214/17-EJP105 MR3710800Broutin, N. and Wang, M. (2017). Reversing the cut tree of the Brownian continuum random tree. Electron. J. Probab. 22 Paper No. 80, 23.  10.1214/17-EJP105 MR3710800

24.

Brown, J. and Mol, L. (2020). On the roots of the subtree polynomial. European Journal of Combinatorics 89 103181.  10.1016/j.ejc.2020.103181 MR4119982Brown, J. and Mol, L. (2020). On the roots of the subtree polynomial. European Journal of Combinatorics 89 103181.  10.1016/j.ejc.2020.103181 MR4119982

25.

Buchanan, A., Wang, Y. and Butenko, S. (2017). Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72.  10.1002/net.21825 MR3857980Buchanan, A., Wang, Y. and Butenko, S. (2017). Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72.  10.1002/net.21825 MR3857980

26.

Burton, R. and Pemantle, R. (1993). Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. The Annals of Probability 21 1329–1371.  10.1214/aop/1176989121 MR1235419Burton, R. and Pemantle, R. (1993). Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. The Annals of Probability 21 1329–1371.  10.1214/aop/1176989121 MR1235419

27.

Cabezas, M., Fribergh, A., Holmes, M. and Perkins, E. (2023). Historical lattice trees. Commun. Math. Phys.  MR4604900Cabezas, M., Fribergh, A., Holmes, M. and Perkins, E. (2023). Historical lattice trees. Commun. Math. Phys.  MR4604900

28.

Caminiti, S., Finocchi, I. and Petreschi, R. (2007). On coding labeled trees. Theoretical Computer Science 382 97–108. Latin American Theoretical Informatics.  10.1016/j.tcs.2007.03.009 MR2352105Caminiti, S., Finocchi, I. and Petreschi, R. (2007). On coding labeled trees. Theoretical Computer Science 382 97–108. Latin American Theoretical Informatics.  10.1016/j.tcs.2007.03.009 MR2352105

29.

Cayley, A. (1889). A theorem on trees. The Quarterly Journal of Mathematics 23 376–378.Cayley, A. (1889). A theorem on trees. The Quarterly Journal of Mathematics 23 376–378.

30.

Chaiken, S. and Kleitman, D. (1978). Matrix tree theorems. J. Combinatorial Theory Ser. A 24 377–381.  10.1016/0097-3165(78)90067-5 MR480115Chaiken, S. and Kleitman, D. (1978). Matrix tree theorems. J. Combinatorial Theory Ser. A 24 377–381.  10.1016/0097-3165(78)90067-5 MR480115

31.

Chassaing, P. and Louchard, G. (2002). Phase transition for parking blocks, Brownian excursion and coalescence. Random Structures Algorithms 21 76–119.  10.1002/rsa.10039 MR1913079Chassaing, P. and Louchard, G. (2002). Phase transition for parking blocks, Brownian excursion and coalescence. Random Structures Algorithms 21 76–119.  10.1002/rsa.10039 MR1913079

32.

Chassaing, P. and Marckert, J.-F. (2001). Parking functions, empirical processes, and the width of rooted labeled trees. Electron. J. Combin. 8 Research Paper 14, 19.  MR1814521Chassaing, P. and Marckert, J.-F. (2001). Parking functions, empirical processes, and the width of rooted labeled trees. Electron. J. Combin. 8 Research Paper 14, 19.  MR1814521

33.

Chimani, M., Kandyba, M., Ljubić, I. and Mutzel, P. (2010). Obtaining optimal k-cardinality trees fast. JEA 14 2.5–2.23.  MR2770843Chimani, M., Kandyba, M., Ljubić, I. and Mutzel, P. (2010). Obtaining optimal k-cardinality trees fast. JEA 14 2.5–2.23.  MR2770843

34.

Chin, A., Gordon, G., MacPhee, K. and Vincent, C. (2018). Subtrees of graphs. Journal of Graph Theory 89 413–438.  10.1002/jgt.22359 MR3875138Chin, A., Gordon, G., MacPhee, K. and Vincent, C. (2018). Subtrees of graphs. Journal of Graph Theory 89 413–438.  10.1002/jgt.22359 MR3875138

35.

Colbourn, C., Day, R. and Nel, L. (1989). Unranking and ranking spanning trees of a graph. J. Algorithms 10 271–286.  10.1016/0196-6774(89)90016-3 MR993191Colbourn, C., Day, R. and Nel, L. (1989). Unranking and ranking spanning trees of a graph. J. Algorithms 10 271–286.  10.1016/0196-6774(89)90016-3 MR993191

36.

Colbourn, C., Myrvold, W. and Neufeld, E. (1996). Two algorithms for unranking arborescences. J. Algorithms 20 268–281.  10.1006/jagm.1996.0014 MR1379225Colbourn, C., Myrvold, W. and Neufeld, E. (1996). Two algorithms for unranking arborescences. J. Algorithms 20 268–281.  10.1006/jagm.1996.0014 MR1379225

37.

Cooper, C., Frieze, A., Ince, N., Janson, S. and Spencer, J. (2016). On the length of a random minimum spanning tree. Combin. Probab. Comput. 25 89–107.  10.1017/S0963548315000024 MR3438287Cooper, C., Frieze, A., Ince, N., Janson, S. and Spencer, J. (2016). On the length of a random minimum spanning tree. Combin. Probab. Comput. 25 89–107.  10.1017/S0963548315000024 MR3438287

38.

Cormen, T., Leiserson, C., Rivest, R. and Stein, C. (2009). Introduction to Algorithms, 3rd ed. The MIT Press.  MR2572804Cormen, T., Leiserson, C., Rivest, R. and Stein, C. (2009). Introduction to Algorithms, 3rd ed. The MIT Press.  MR2572804

39.

da Silva, R., Dahmen, S. R. and de Felício, J. R. D. (2021). Transfer matrix in counting problems. International Journal of Modern Physics C 33.  10.1142/s0129183122500322 MR4407756da Silva, R., Dahmen, S. R. and de Felício, J. R. D. (2021). Transfer matrix in counting problems. International Journal of Modern Physics C 33.  10.1142/s0129183122500322 MR4407756

40.

Derbez, E. and Slade, G. (1998). The scaling limit of lattice trees in high dimensions. Comm. Math. Phys. 193 69–104.  10.1007/s002200050319 MR1620301Derbez, E. and Slade, G. (1998). The scaling limit of lattice trees in high dimensions. Comm. Math. Phys. 193 69–104.  10.1007/s002200050319 MR1620301

41.

Devroye, L. (2012). Simulating size-constrained Galton–Watson trees. SIAM Journal on Computing 41 1–11.  10.1137/090766632 MR2888318Devroye, L. (2012). Simulating size-constrained Galton–Watson trees. SIAM Journal on Computing 41 1–11.  10.1137/090766632 MR2888318

42.

Diaconis, P. and Fulton, W. (1993). A growth model, a game, an algebra, Lagrange inversion, and characteristic classes. Rend. Sem. Math. Univ. Politec. Torino 49 95–119.  MR1218674Diaconis, P. and Fulton, W. (1993). A growth model, a game, an algebra, Lagrange inversion, and characteristic classes. Rend. Sem. Math. Univ. Politec. Torino 49 95–119.  MR1218674

43.

Duchon, P., Flajolet, P., Louchard, G. and Schaeffer, G. (2004). Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability & Computing 13 577.  MR2095975Duchon, P., Flajolet, P., Louchard, G. and Schaeffer, G. (2004). Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability & Computing 13 577.  MR2095975

44.

Duquesne, T. and Le Gall, J.-F. (2002). Random Trees, Lévy Processes and Spatial Branching Processes. Astérisque 281. Société Mathématique de France.  MR1954248Duquesne, T. and Le Gall, J.-F. (2002). Random Trees, Lévy Processes and Spatial Branching Processes. Astérisque 281. Société Mathématique de France.  MR1954248

45.

Durfee, D., Kyng, R., Peebles, J., Rao, A. and Sachdeva, S. (2017). Sampling random spanning trees faster than matrix multiplication. In Proceedings of the 49th Annual ACM SIGACT STOC 730–742. Association for Computing Machinery, New York.  10.1145/3055399.3055499 MR3678224Durfee, D., Kyng, R., Peebles, J., Rao, A. and Sachdeva, S. (2017). Sampling random spanning trees faster than matrix multiplication. In Proceedings of the 49th Annual ACM SIGACT STOC 730–742. Association for Computing Machinery, New York.  10.1145/3055399.3055499 MR3678224

46.

Eberz-Wagner, D. (1999). Discrete growth models, PhD thesis, ProQuest LLC, Ann Arbor, MI, University of Washington.  MR2699374Eberz-Wagner, D. (1999). Discrete growth models, PhD thesis, ProQuest LLC, Ann Arbor, MI, University of Washington.  MR2699374

47.

Evans, S. N., Grübel, R. and Wakolbinger, A. (2017). Doob-Martin boundary of Rémy’s tree growth chain. Ann. Probab. 45 225–277.  10.1214/16-AOP1112 MR3601650Evans, S. N., Grübel, R. and Wakolbinger, A. (2017). Doob-Martin boundary of Rémy’s tree growth chain. Ann. Probab. 45 225–277.  10.1214/16-AOP1112 MR3601650

48.

Fredes, L. and Marckert, J.-F. (2020).  http://www.labri.fr/perso/marckert/Random_Trees_Of_The_Torus.html. Simulation web page.Fredes, L. and Marckert, J.-F. (2020).  http://www.labri.fr/perso/marckert/Random_Trees_Of_The_Torus.html. Simulation web page.

49.

Fredes, L. and Marckert, J.-F. (2021). Aldous-Broder theorem: extension to the non reversible case and new combinatorial proof.Fredes, L. and Marckert, J.-F. (2021). Aldous-Broder theorem: extension to the non reversible case and new combinatorial proof.

50.

Fredes, L. and Marckert, J.-F. (2021). Almost triangular Markov chains on $\mathbb{N}$.  10.48550/ARXIV.2109.06549Fredes, L. and Marckert, J.-F. (2021). Almost triangular Markov chains on $\mathbb{N}$.  10.48550/ARXIV.2109.06549

51.

Fredes, L. and Sepúlveda, A. (2020). Tree-decorated planar maps. Electronic Journal of Combinatorics 27.  10.37236/8635 MR4093167Fredes, L. and Sepúlveda, A. (2020). Tree-decorated planar maps. Electronic Journal of Combinatorics 27.  10.37236/8635 MR4093167

52.

Frieze, A. (1985). On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10 47–56.  10.1016/0166-218X(85)90058-7 MR770868Frieze, A. (1985). On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10 47–56.  10.1016/0166-218X(85)90058-7 MR770868

53.

Garban, C., Pete, G. and Schramm, O. (2018). The scaling limits of the Minimal Spanning Tree and Invasion Percolation in the plane. The Annals of Probability 46 3501–3557.  10.1214/17-AOP1252 MR3857861Garban, C., Pete, G. and Schramm, O. (2018). The scaling limits of the Minimal Spanning Tree and Invasion Percolation in the plane. The Annals of Probability 46 3501–3557.  10.1214/17-AOP1252 MR3857861

54.

Graham, R. L. and Hell, P. (1985). On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7 43–57.  10.1109/MAHC.1985.10011 MR783327Graham, R. L. and Hell, P. (1985). On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7 43–57.  10.1109/MAHC.1985.10011 MR783327

55.

Guénoche, A. (1983). Random spanning tree. J. Algorithms 4 214–220.  10.1016/0196-6774(83)90022-6 MR710718Guénoche, A. (1983). Random spanning tree. J. Algorithms 4 214–220.  10.1016/0196-6774(83)90022-6 MR710718

56.

Hara, T. and Slade, G. (1990). On the upper critical dimension of lattice trees and lattice animals. J. Statist. Phys. 59 1469–1510.  10.1007/BF01334760 MR1063208Hara, T. and Slade, G. (1990). On the upper critical dimension of lattice trees and lattice animals. J. Statist. Phys. 59 1469–1510.  10.1007/BF01334760 MR1063208

57.

Holmes, M. (2008). Convergence of lattice trees to super-Brownian motion above the critical dimension. Electron. J. Probab. 13, no. 23, 671–755.  10.1214/EJP.v13-499 MR2399294Holmes, M. (2008). Convergence of lattice trees to super-Brownian motion above the critical dimension. Electron. J. Probab. 13, no. 23, 671–755.  10.1214/EJP.v13-499 MR2399294

58.

Holmes, M. (2016). Backbone scaling for critical lattice trees in high dimensions. Journal of Physics A: Mathematical and Theoretical 49 314001.  10.1088/1751-8113/49/31/314001 MR3519275Holmes, M. (2016). Backbone scaling for critical lattice trees in high dimensions. Journal of Physics A: Mathematical and Theoretical 49 314001.  10.1088/1751-8113/49/31/314001 MR3519275

59.

Holmgren, C. and Janson, S. (2017). Fringe trees, Crump–Mode–Jagers branching processes and m-ary search trees. Probability Surveys 14 53–154.  10.1214/16-PS272 MR3626585Holmgren, C. and Janson, S. (2017). Fringe trees, Crump–Mode–Jagers branching processes and m-ary search trees. Probability Surveys 14 53–154.  10.1214/16-PS272 MR3626585

60.

Hsu, H.-P., Nadler, W. and Grassberger, P. (2005). Simulations of lattice animals and trees. Journal of Physics A: Mathematical and General 38 775–806.  10.1088/0305-4470/38/4/001 MR2125234Hsu, H.-P., Nadler, W. and Grassberger, P. (2005). Simulations of lattice animals and trees. Journal of Physics A: Mathematical and General 38 775–806.  10.1088/0305-4470/38/4/001 MR2125234

61.

Hu, T. (1974). Optimum communication spanning trees. SIAM J. Comput. 3 188–195.  10.1137/0203015 MR427116Hu, T. (1974). Optimum communication spanning trees. SIAM J. Comput. 3 188–195.  10.1137/0203015 MR427116

62.

Hu, Y., Lyons, R. and Tang, P. (2021). A reverse Aldous–Broder algorithm. In Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 57-2 890–900. Institut Henri Poincaré.  MR4260489Hu, Y., Lyons, R. and Tang, P. (2021). A reverse Aldous–Broder algorithm. In Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 57-2 890–900. Institut Henri Poincaré.  MR4260489

63.

Jaeger, F., Vertigan, D. and Welsh, D. . (1990). On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108 35–53.  10.1017/S0305004100068936 MR1049758Jaeger, F., Vertigan, D. and Welsh, D. . (1990). On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108 35–53.  10.1017/S0305004100068936 MR1049758

64.

Janse van Rensburg, E. and Madras, N. (1992). A non-local Monte Carlo algorithm for lattice trees. Journal of Physics. A, Mathematical and General.  MR1147134Janse van Rensburg, E. and Madras, N. (1992). A non-local Monte Carlo algorithm for lattice trees. Journal of Physics. A, Mathematical and General.  MR1147134

65.

Janse van Rensburg, E. and Rechnitzer, A. (2003). High precision canonical Monte Carlo determination of the growth constant of square lattice trees. Phys. Rev. E 67 036116.  10.1103/PhysRevE.67.036116Janse van Rensburg, E. and Rechnitzer, A. (2003). High precision canonical Monte Carlo determination of the growth constant of square lattice trees. Phys. Rev. E 67 036116.  10.1103/PhysRevE.67.036116

66.

Janson, S. (1995). The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Structures Algorithms 7 337–355.  10.1002/rsa.3240070406 MR1369071Janson, S. (1995). The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Structures Algorithms 7 337–355.  10.1002/rsa.3240070406 MR1369071

67.

Janson, S. (1999). One, two and three times $logn∕n$ for paths in a complete graph with random weights. Combinatorics, Probability and Computing 8 347–361.  10.1017/S0963548399003892 MR1723648Janson, S. (1999). One, two and three times $logn∕n$ for paths in a complete graph with random weights. Combinatorics, Probability and Computing 8 347–361.  10.1017/S0963548399003892 MR1723648

68.

Janson, S. (2006). Random cutting and records in deterministic and random trees. Random Structures & Algorithms 29 139–179.  MR2245498Janson, S. (2006). Random cutting and records in deterministic and random trees. Random Structures & Algorithms 29 139–179.  MR2245498

69.

Janson, S. (2012). Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation. Probability Surveys 9 103–252.  10.1214/11-PS188 MR2908619Janson, S. (2012). Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation. Probability Surveys 9 103–252.  10.1214/11-PS188 MR2908619

70.

Jensen, I. (2001). Enumerations of lattice animals and trees. In Proceedings of the Baxter Revolution in Mathematical Physics (Canberra, 2000) 102 865–881.  10.1023/A:1004855020556 MR1832073Jensen, I. (2001). Enumerations of lattice animals and trees. In Proceedings of the Baxter Revolution in Mathematical Physics (Canberra, 2000) 102 865–881.  10.1023/A:1004855020556 MR1832073

71.

Jerison, D., Levine, L. and Sheffield, S. (2012). Logarithmic fluctuations for internal DLA. J. Amer. Math. Soc. 25 271–301.  10.1090/S0894-0347-2011-00716-9 MR2833484Jerison, D., Levine, L. and Sheffield, S. (2012). Logarithmic fluctuations for internal DLA. J. Amer. Math. Soc. 25 271–301.  10.1090/S0894-0347-2011-00716-9 MR2833484

72.

Jerison, D., Levine, L. and Sheffield, S. (2013). Internal DLA in higher dimensions. Electron. J. Probab. 18 No. 98, 14.  10.1214/EJP.v18-3137 MR3141799Jerison, D., Levine, L. and Sheffield, S. (2013). Internal DLA in higher dimensions. Electron. J. Probab. 18 No. 98, 14.  10.1214/EJP.v18-3137 MR3141799

73.

Jerison, D., Levine, L. and Sheffield, S. (2014). Internal DLA and the Gaussian free field. Duke Math. J. 163 267–308.  10.1215/00127094-2430259 MR3161315Jerison, D., Levine, L. and Sheffield, S. (2014). Internal DLA and the Gaussian free field. Duke Math. J. 163 267–308.  10.1215/00127094-2430259 MR3161315

74.

Jerrum, M. (1994). Counting trees in a graph is #P-complete. Information Processing Letters 51 111–116.  10.1016/0020-0190(94)00085-9 MR1290202Jerrum, M. (1994). Counting trees in a graph is #P-complete. Information Processing Letters 51 111–116.  10.1016/0020-0190(94)00085-9 MR1290202

75.

Jerrum, M., Valiant, L. and Vazirani, V. (1986). Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 169–188.  10.1016/0304-3975(86)90174-X MR0855970Jerrum, M., Valiant, L. and Vazirani, V. (1986). Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 169–188.  10.1016/0304-3975(86)90174-X MR0855970

76.

Járai, A. (2009). The Uniform Spanning Tree and related models.  http://www.maths.bath.ac.uk/%7Eaj276/teaching/USF/USFnotes.pdf.Járai, A. (2009). The Uniform Spanning Tree and related models.  http://www.maths.bath.ac.uk/%7Eaj276/teaching/USF/USFnotes.pdf.

77.

Karlin, S. and McGregor, J. (1957). The differential equations of birth-and-death processes, and the Stieltjes moment problem. Trans. Amer. Math. Soc. 85 489–546.  10.2307/1992942 MR91566Karlin, S. and McGregor, J. (1957). The differential equations of birth-and-death processes, and the Stieltjes moment problem. Trans. Amer. Math. Soc. 85 489–546.  10.2307/1992942 MR91566

78.

Karlin, S. and McGregor, J. (1957). The classification of birth and death processes. Trans. Amer. Math. Soc. 86 366–400.  10.2307/1993021 MR94854Karlin, S. and McGregor, J. (1957). The classification of birth and death processes. Trans. Amer. Math. Soc. 86 366–400.  10.2307/1993021 MR94854

79.

Karp, R. (1972). Reducibility among Combinatorial Problems In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center 85–103. Springer US, Boston, MA.  10.1007/978-1-4684-2001-2_9 MR0378476Karp, R. (1972). Reducibility among Combinatorial Problems In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center 85–103. Springer US, Boston, MA.  10.1007/978-1-4684-2001-2_9 MR0378476

80.

Kelner, J. and Mądry, A. (2009). Faster generation of random spanning trees. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2009 13–21. IEEE Computer Soc., Los Alamitos, CA.  10.1109/FOCS.2009.75 MR2648384Kelner, J. and Mądry, A. (2009). Faster generation of random spanning trees. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2009 13–21. IEEE Computer Soc., Los Alamitos, CA.  10.1109/FOCS.2009.75 MR2648384

81.

Kesten, H. (1986). Subdiffusive behavior of random walk on a random cluster. Annales de l’Institut Henri Poincare – Probabilites et Statistiques 22 425–487.  MR0871905Kesten, H. (1986). Subdiffusive behavior of random walk on a random cluster. Annales de l’Institut Henri Poincare – Probabilites et Statistiques 22 425–487.  MR0871905

82.

Kirchhoff, G. (1847). Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Annalen der Physik 148 497–508.Kirchhoff, G. (1847). Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Annalen der Physik 148 497–508.

83.

Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 48–50.  MR0078686Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 48–50.  MR0078686

84.

Kulkarni, V. (1990). Generating random combinatorial objects. J. Algorithms 11 185–207.  10.1016/0196-6774(90)90002-V MR1052800Kulkarni, V. (1990). Generating random combinatorial objects. J. Algorithms 11 185–207.  10.1016/0196-6774(90)90002-V MR1052800

85.

Lawler, G. (1996). Intersections of Random Walks. Birkhäuser.  MR1410533Lawler, G. (1996). Intersections of Random Walks. Birkhäuser.  MR1410533

86.

Lawler, G. (1999). Loop-erased random walk In Perplexing Problems in Probability: Festschrift in Honor of Harry Kesten 197–217. Birkhäuser Boston, Boston, MA.  10.1007/978-1-4612-2168-5_12 MR1703133Lawler, G. (1999). Loop-erased random walk In Perplexing Problems in Probability: Festschrift in Honor of Harry Kesten 197–217. Birkhäuser Boston, Boston, MA.  10.1007/978-1-4612-2168-5_12 MR1703133

87.

Lawler, G. (2005). Conformally Invariant Processes in the Plane. Mathematical Surveys and Monographs 114. American Mathematical Society, Providence, RI.  10.1090/surv/114 MR2129588Lawler, G. (2005). Conformally Invariant Processes in the Plane. Mathematical Surveys and Monographs 114. American Mathematical Society, Providence, RI.  10.1090/surv/114 MR2129588

88.

Lawler, G., Bramson, M. and Griffeath, D. (1992). Internal diffusion limited aggregation. The Annals of Probability 20 2117–2140.  MR1188055Lawler, G., Bramson, M. and Griffeath, D. (1992). Internal diffusion limited aggregation. The Annals of Probability 20 2117–2140.  MR1188055

89.

Lawler, G., Schramm, O. and Werner, W. (2004). Conformal invariance of planar loop-erased random walks and uniform spanning trees. Ann. Probab. 32 939–995.  10.1214/aop/1079021469 MR2044671Lawler, G., Schramm, O. and Werner, W. (2004). Conformal invariance of planar loop-erased random walks and uniform spanning trees. Ann. Probab. 32 939–995.  10.1214/aop/1079021469 MR2044671

90.

Lawler, G. F. (1995). Subdiffusive fluctuations for internal diffusion limited aggregation. The Annals of Probability 23 71–86.  10.1214/aop/1176988377 MR1330761Lawler, G. F. (1995). Subdiffusive fluctuations for internal diffusion limited aggregation. The Annals of Probability 23 71–86.  10.1214/aop/1176988377 MR1330761

91.

Luczak, M. and Winkler, P. (2004). Building uniformly random subtrees. Random Structures Algorithms 24 420–443.  10.1002/rsa.20011 MR2060629Luczak, M. and Winkler, P. (2004). Building uniformly random subtrees. Random Structures Algorithms 24 420–443.  10.1002/rsa.20011 MR2060629

92.

Luna-Mota, C. (2016). The optimum communication spanning tree problem: properties, models and algorithms, PhD thesis, Universitat Politècnica de Catalunya.Luna-Mota, C. (2016). The optimum communication spanning tree problem: properties, models and algorithms, PhD thesis, Universitat Politècnica de Catalunya.

93.

Lyons, R. and Peres, Y. (2017). Probability on Trees and Networks. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press.  10.1017/9781316672815 MR3616205Lyons, R. and Peres, Y. (2017). Probability on Trees and Networks. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press.  10.1017/9781316672815 MR3616205

94.

Makarov, N., Smirnov, S. et al. (2010). Off-critical lattice models and massive SLEs. In XVIth International Congress on Mathematical Physics 362371. Doppler Institute, World Scientific Singapore.Makarov, N., Smirnov, S. et al. (2010). Off-critical lattice models and massive SLEs. In XVIth International Congress on Mathematical Physics 362371. Doppler Institute, World Scientific Singapore.

95.

Marchal, P. (2000). Loop-erased random walks, spanning trees and Hamiltonian cycles. Electron. Comm. Probab. 5 39–50.  10.1214/ECP.v5-1016 MR1736723Marchal, P. (2000). Loop-erased random walks, spanning trees and Hamiltonian cycles. Electron. Comm. Probab. 5 39–50.  10.1214/ECP.v5-1016 MR1736723

96.

Marchal, P. (2003). Constructing a sequence of random walks strongly converging to Brownian motion. In Discrete Random Walks (Paris, 2003). Discrete Math. Theor. Comput. Sci. Proc., AC 181–190. Assoc. Discrete Math. Theor. Comput. Sci., Nancy.  MR2042386Marchal, P. (2003). Constructing a sequence of random walks strongly converging to Brownian motion. In Discrete Random Walks (Paris, 2003). Discrete Math. Theor. Comput. Sci. Proc., AC 181–190. Assoc. Discrete Math. Theor. Comput. Sci., Nancy.  MR2042386

97.

Marckert, J.-F. (2023). Growing Random Uniform d-ary Trees.  10.1007/s00026-022-00621-3 MR4557916Marckert, J.-F. (2023). Growing Random Uniform d-ary Trees.  10.1007/s00026-022-00621-3 MR4557916

98.

Marckert, J.-F. and Mokkadem, A. (2003). The depth first processes of Galton-Watson trees converge to the same Brownian excursion. Ann. Probab. 31 1655–1678.  10.1214/aop/1055425793 MR1989446Marckert, J.-F. and Mokkadem, A. (2003). The depth first processes of Galton-Watson trees converge to the same Brownian excursion. Ann. Probab. 31 1655–1678.  10.1214/aop/1055425793 MR1989446

99.

Marckert, J.-F., Saheb-Djahromi, N. and Zemmari, A. (2009). Election algorithms with random delays in trees. In Discrete Mathematics and Theoretical Computer Science 611–622.  MR2721547Marckert, J.-F., Saheb-Djahromi, N. and Zemmari, A. (2009). Election algorithms with random delays in trees. In Discrete Mathematics and Theoretical Computer Science 611–622.  MR2721547

100.

Marckert, J.-F. and Wang, M. (2019). A new combinatorial representation of the additive coalescent. Random Structures Algorithms 54 340–370.  10.1002/rsa.20775 MR3912100Marckert, J.-F. and Wang, M. (2019). A new combinatorial representation of the additive coalescent. Random Structures Algorithms 54 340–370.  10.1002/rsa.20775 MR3912100

101.

Meir, A. and Moon, J. (1970). Cutting down random trees. Journal of the Australian Mathematical Society 313–324.  MR0284370Meir, A. and Moon, J. (1970). Cutting down random trees. Journal of the Australian Mathematical Society 313–324.  MR0284370

102.

Métivier, Y., Saheb-Djahromi, N. and Zemmari, A. (2005). Locally guided randomized elections in trees: The totally fair case. Information and Computation 198 40–55.  MR2131184Métivier, Y., Saheb-Djahromi, N. and Zemmari, A. (2005). Locally guided randomized elections in trees: The totally fair case. Information and Computation 198 40–55.  MR2131184

103.

Moon, J. (1970). Counting Labelled Trees. Canadian Mathematical Monographs, No. 1. Canadian Mathematical Congress, Montreal, Que. From lectures delivered to the Twelfth Biennial Seminar of the Canadian Mathematical Congress (Vancouver, 1969).  MR0274333Moon, J. (1970). Counting Labelled Trees. Canadian Mathematical Monographs, No. 1. Canadian Mathematical Congress, Montreal, Que. From lectures delivered to the Twelfth Biennial Seminar of the Canadian Mathematical Congress (Vancouver, 1969).  MR0274333

104.

Mądry, A., Straszak, D. and Tarnawski, J. (2015). Fast generation of random spanning trees and the effective resistance metric. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms 2019–2036. SIAM, Philadelphia, PA.  10.1137/1.9781611973730.134 MR3451158Mądry, A., Straszak, D. and Tarnawski, J. (2015). Fast generation of random spanning trees and the effective resistance metric. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms 2019–2036. SIAM, Philadelphia, PA.  10.1137/1.9781611973730.134 MR3451158

105.

Nesĕtrĭl, J., Milková, E. and Nešetřilová, H. (2001). Otakar Bor˙uvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history. In Graph Theory (Prague, 1998) 233 3–36.  10.1016/S0012-365X(00)00224-7 MR1825599Nesĕtrĭl, J., Milková, E. and Nešetřilová, H. (2001). Otakar Bor˙uvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history. In Graph Theory (Prague, 1998) 233 3–36.  10.1016/S0012-365X(00)00224-7 MR1825599

106.

Neville, E. (1953). The codifying of tree-structure. Mathematical Proceedings of the Cambridge Philosophical Society 49 381–385.  10.1017/S030500410002853X MR0054936Neville, E. (1953). The codifying of tree-structure. Mathematical Proceedings of the Cambridge Philosophical Society 49 381–385.  10.1017/S030500410002853X MR0054936

107.

Otter, R. (1949). The multiplicative process. Ann. Math. Statistics 20 206–224.  10.1214/aoms/1177730031 MR30716Otter, R. (1949). The multiplicative process. Ann. Math. Statistics 20 206–224.  10.1214/aoms/1177730031 MR30716

108.

Pemantle, R. (1991). Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 19 1559–1574.  MR1127715Pemantle, R. (1991). Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 19 1559–1574.  MR1127715

109.

Peres, Y. and Revelle, D. (2004). Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs.  10.48550/ARXIV.MATH/0410430Peres, Y. and Revelle, D. (2004). Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs.  10.48550/ARXIV.MATH/0410430

110.

Pitman, J. (2006). Combinatorial Stochastic Processes. Lecture Notes in Mathematics 1875. Springer-Verlag, Berlin. Lectures from the 32nd Summer School on Probability Theory held in Saint-Flour, July 7–24, 2002.  MR2245368Pitman, J. (2006). Combinatorial Stochastic Processes. Lecture Notes in Mathematics 1875. Springer-Verlag, Berlin. Lectures from the 32nd Summer School on Probability Theory held in Saint-Flour, July 7–24, 2002.  MR2245368

111.

Prim, R. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal 36 1389–1401.  10.1002/j.1538-7305.1957.tb01515.xPrim, R. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal 36 1389–1401.  10.1002/j.1538-7305.1957.tb01515.x

112.

Procaccia, E. and Zhang, Y. (2019). Stationary harmonic measure and DLA in the upper half plane. J. Stat. Phys. 176 946–980.  10.1007/s10955-019-02327-y MR3990220Procaccia, E. and Zhang, Y. (2019). Stationary harmonic measure and DLA in the upper half plane. J. Stat. Phys. 176 946–980.  10.1007/s10955-019-02327-y MR3990220

113.

Propp, J. and Wilson, D. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures & Algorithms 9 223–252.  MR1611693Propp, J. and Wilson, D. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures & Algorithms 9 223–252.  MR1611693

114.

Propp, J. and Wilson, D. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms 27 170–217.  MR1622393Propp, J. and Wilson, D. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms 27 170–217.  MR1622393

115.

Propp, J. and Wilson, D. (1998). Coupling from the past: a user’s guide. Microsurveys in Discrete Probability 41 181–192.  MR1630414Propp, J. and Wilson, D. (1998). Coupling from the past: a user’s guide. Microsurveys in Discrete Probability 41 181–192.  MR1630414

116.

Prüfer, H. (1918). Neuer Beweis eines Satzes über Permutationen. Archiv der Mathematischen Physik 27 742–744.Prüfer, H. (1918). Neuer Beweis eines Satzes über Permutationen. Archiv der Mathematischen Physik 27 742–744.

117.

Rémy, J.-L. (1985). Un procédé itératif de dénombrement d’arbres binaires et son application à leur génération aléatoire. RAIRO Inform. Théor. 19 179–195.  10.1051/ita/1985190201791 MR803997Rémy, J.-L. (1985). Un procédé itératif de dénombrement d’arbres binaires et son application à leur génération aléatoire. RAIRO Inform. Théor. 19 179–195.  10.1051/ita/1985190201791 MR803997

118.

Schild, A. (2017). An almost-linear time algorithm for uniform random spanning tree generation. CoRR abs/1711.06455.  MR3826248Schild, A. (2017). An almost-linear time algorithm for uniform random spanning tree generation. CoRR abs/1711.06455.  MR3826248

119.

Schild, A. (2018). An almost-linear time algorithm for uniform random spanning tree generation. In STOC’18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing 214–227. ACM, New York.  10.1145/3188745.3188852 MR3826248Schild, A. (2018). An almost-linear time algorithm for uniform random spanning tree generation. In STOC’18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing 214–227. ACM, New York.  10.1145/3188745.3188852 MR3826248

120.

Schramm, O. (2000). Scaling limits of loop-erased random walks and uniform spanning trees. Israel J. Math. 118 221–288.  10.1007/BF02803524 MR1776084Schramm, O. (2000). Scaling limits of loop-erased random walks and uniform spanning trees. Israel J. Math. 118 221–288.  10.1007/BF02803524 MR1776084

121.

Schramm, O. (2007). Conformally invariant scaling limits: an overview and a collection of problems. In International Congress of Mathematicians. Vol. I 513–543. Eur. Math. Soc., Zürich.  10.4171/022-1/20 MR2334202Schramm, O. (2007). Conformally invariant scaling limits: an overview and a collection of problems. In International Congress of Mathematicians. Vol. I 513–543. Eur. Math. Soc., Zürich.  10.4171/022-1/20 MR2334202

122.

Schweinsberg, J. (2009). The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus. Probab. Theory Related Fields 144 319–370.  10.1007/s00440-008-0149-7 MR2496437Schweinsberg, J. (2009). The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus. Probab. Theory Related Fields 144 319–370.  10.1007/s00440-008-0149-7 MR2496437

123.

Slade, G. (2006). The Lace Expansion and Its Applications. Lecture Notes in Mathematics 1879. Springer-Verlag, Berlin. Lectures from the 34th Summer School on Probability Theory held in Saint-Flour, July 6–24, 2004, Edited and with a foreword by Jean Picard.  MR2239599Slade, G. (2006). The Lace Expansion and Its Applications. Lecture Notes in Mathematics 1879. Springer-Verlag, Berlin. Lectures from the 34th Summer School on Probability Theory held in Saint-Flour, July 6–24, 2004, Edited and with a foreword by Jean Picard.  MR2239599

124.

Steele, M. (1987). On Frieze’s $\mathit{\zeta }(3)$ limit for lengths of minimal spanning trees. Discrete Appl. Math. 18 99–103.  10.1016/0166-218X(87)90047-3 MR905183Steele, M. (1987). On Frieze’s $\mathit{\zeta }(3)$ limit for lengths of minimal spanning trees. Discrete Appl. Math. 18 99–103.  10.1016/0166-218X(87)90047-3 MR905183

125.

Tutte, W. (1954). A contribution to the theory of chromatic polynomials. Canadian Journal of Mathematics 6 80–91.  MR0061366Tutte, W. (1954). A contribution to the theory of chromatic polynomials. Canadian Journal of Mathematics 6 80–91.  MR0061366

126.

Vicsek, T. (1992). Fractal Growth Phenomena. World Scientific.  10.1142/1407 MR1182314Vicsek, T. (1992). Fractal Growth Phenomena. World Scientific.  10.1142/1407 MR1182314

127.

Viennot, X. (1986). Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Combinatoire énumérative (G. Labelle and P. Leroux, eds.) 321–350. Springer Berlin Heidelberg, Berlin, Heidelberg.  MR0927773Viennot, X. (1986). Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Combinatoire énumérative (G. Labelle and P. Leroux, eds.) 321–350. Springer Berlin Heidelberg, Berlin, Heidelberg.  MR0927773

128.

Wagner, S. (2019). On the probability that a random subtree is spanning.  arXiv:1910.07349.  MR4371437Wagner, S. (2019). On the probability that a random subtree is spanning.  arXiv:1910.07349.  MR4371437

129.

Welsh, D. (1999). The Tutte polynomial. Random Structures & Algorithms 15 210–228.  10.1002/(SICI)1098-2418(199910/12)15:3/4<210::AID-RSA2>3.0.CO;2-R MR1716762Welsh, D. (1999). The Tutte polynomial. Random Structures & Algorithms 15 210–228.  10.1002/(SICI)1098-2418(199910/12)15:3/4<210::AID-RSA2>3.0.CO;2-R MR1716762

130.

Welsh, D. and Merino, C. (2000). The Potts model and the Tutte polynomial. Journal of Mathematical Physics 41 1127–1152. Probabilistic techniques in equilibrium and nonequilibrium statistical physics.  10.1063/1.533181 MR1757953Welsh, D. and Merino, C. (2000). The Potts model and the Tutte polynomial. Journal of Mathematical Physics 41 1127–1152. Probabilistic techniques in equilibrium and nonequilibrium statistical physics.  10.1063/1.533181 MR1757953

131.

Werner, W., Schramm, O. and Lawler, G. (2004). Conformal invariance of planar loop-erased random walks and uniform spanning trees. The Annals of Probability 32 939–995.  10.1214/aop/1079021469 MR2044671Werner, W., Schramm, O. and Lawler, G. (2004). Conformal invariance of planar loop-erased random walks and uniform spanning trees. The Annals of Probability 32 939–995.  10.1214/aop/1079021469 MR2044671

132.

Wilson, D. (1996). Generating random spanning trees more quickly than the cover time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing 296–303.  MR1427525Wilson, D. (1996). Generating random spanning trees more quickly than the cover time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing 296–303.  MR1427525

133.

Witten, T. and Sander, L. (1983). Diffusion-limited aggregation. Physical Review B 27 5686–5697.  10.1103/PhysRevB.27.5686 MR0704464Witten, T. and Sander, L. (1983). Diffusion-limited aggregation. Physical Review B 27 5686–5697.  10.1103/PhysRevB.27.5686 MR0704464

134.

Wu, B., Lancia, G., Bafna, V., Chao, K.-M., Ravi, R. and Tang, C. (2000). A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM Journal on Computing 29 761–778.  10.1137/S009753979732253X MR1740574Wu, B., Lancia, G., Bafna, V., Chao, K.-M., Ravi, R. and Tang, C. (2000). A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM Journal on Computing 29 761–778.  10.1137/S009753979732253X MR1740574

135.

Yan, W. and Yeh, Y.-N. (2006). Enumeration of subtrees of trees. Theoretical Computer Science 369 256–268.  10.1016/j.tcs.2006.09.002 MR2277574Yan, W. and Yeh, Y.-N. (2006). Enumeration of subtrees of trees. Theoretical Computer Science 369 256–268.  10.1016/j.tcs.2006.09.002 MR2277574

136.

Zeilberger, D. (1985). A combinatorial approach to matrix algebra. Discrete Mathematics 56 61–72.  10.1016/0012-365X(85)90192-X MR0808086Zeilberger, D. (1985). A combinatorial approach to matrix algebra. Discrete Mathematics 56 61–72.  10.1016/0012-365X(85)90192-X MR0808086

137.

Zetina, C., Contreras, I., Fernández, E. and Luna-Mota, C. (2019). Solving the optimum communication spanning tree problem. European Journal of Operational Research 273 108–117.  10.1016/j.ejor.2018.07.055 MR3863519Zetina, C., Contreras, I., Fernández, E. and Luna-Mota, C. (2019). Solving the optimum communication spanning tree problem. European Journal of Operational Research 273 108–117.  10.1016/j.ejor.2018.07.055 MR3863519