1. Aho, A. V., Hopcroft, J. E., and Ullman, J.D. [AHU] The Design and Analysis of Computer Algorithms, Addison-Wesley, London (1976).
2. Bentley, J. L. and Friedman, J. H. [BeF] Fast algorithms for constructing minimal spanning trees in coordinate spaces, IEEE Trans. Computers, C27, No. 2, 97–105 (1978).
3. Berge, C. and Ghouila-Houri, A. [BeG] Programme, Spiele, Transportnetze, Teubner, Leipzig (1967).
4. Berger, I. and Nathan, A. [BeN] The algebra of sets of trees, K-trees and other configurations, IEEE Trans. Circuit Theory, CT15, No. 3, 221–228 (1968).
5. Burns, R.N. and Haff, C. E. [BuH] A ranking problem in graphs, Proceedings of the 5th Southwest Conf. on Combinatorics, Graph Theory, and Computing (1974), pp. 461–470.