Kruskal, Joseph B. jun. On the shortest spanning subtree of a graph and the traveling salesman problem. (English) Zbl 0070.18404 Proc. Am. Math. Soc. 7, 48-50 (1956). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 543 Documents MSC: 90C27 Combinatorial optimization 90C35 Programming involving graphs or networks 05C85 Graph algorithms (graph-theoretic aspects) Keywords:topology PDFBibTeX XMLCite \textit{J. B. Kruskal jun.}, Proc. Am. Math. Soc. 7, 48--50 (1956; Zbl 0070.18404) Full Text: DOI References: [1] Otakar Borůvka, On a minimal problem, Práce Moravské Pridovedecké Spolecnosti, vol. 3, 1926. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.