1. Borůvka O (1926) O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti 3:37–58. (In Czech)
2. Buchsbaum A, Kaplan H, Rogers A, Westbrook JR (1998) Linear-time pointer-machine algorithms for least common ancestors, MST verification and dominators. In: Proceedings of the ACM symposium on theory of computing (STOC), Dallas, pp 279–288
3. Chan TM (1998) Backward analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees. Inf Process Lett 67:303–304
4. Chazelle B (2000) A minimum spanning tree algorithm with inverse-Ackermann type complexity. J ACM 47(6):1028–1047
5. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT, Cambridge