A note on two problems in connexion with graphs

Kruskal Jr., J. B.: On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem. Proc. Amer. Math. Soc.7, 48–50 (1956). Loberman, H., andA. Weinberger: Formal Procedures, for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Comp. Mach.4, 428–437 (1957). Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956. Berge, C.: Théorie des graphes et ses applications, pp. 68–69 Paris Dunod 1958.