1. N. Alon, J. Spencer. The Probabilistic Method. Wiley, New York, 1992.
2. O. Borüvka. O jistém problému minimaálním. Moravské Přírodovědecké Společnosti 3, pp. 37–58, 1926. (In Czech).
3. B. Chazelle. A faster deterministic algorithm for minimum spanning trees. In FOCS’ 97, pp. 22–31, 1997.
4. Lect Notes Comput Sci;B. Chazelle,1998
5. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. NECI Technical Report 99-099, 1999.