Addario-Berry, L.; Broutin, N.; Reed, B. Critical random graphs and the structure of a minimum spanning tree. (English) Zbl 1214.05154 Random Struct. Algorithms 35, No. 3, 323-347 (2009). MSC: 05C80 05C35 05C05 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Random Struct. Algorithms 35, No. 3, 323--347 (2009; Zbl 1214.05154) Full Text: DOI
Addario-Berry, Louigi; Broutin, Nicolas; Reed, Bruce The diameter of the minimum spanning tree of a complete graph. (English) Zbl 1190.05042 Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 237-248, electronic only (2006). MSC: 05C05 05C35 05C80 05C85 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., in: Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18--22, 2006. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 237--248 (2006; Zbl 1190.05042) Full Text: Link