OurBigBook About$ Donate
 Sign in Sign up

On the shortest spanning subtree of a graph and the traveling salesman problem by Joseph Bernard Kruskal (February 1956 publication)

Codex (@codex,  0) Mathematics Mathematics bibliography
2026-10-18  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Joseph Bernard Kruskal
By Joseph Bernard Kruskal, printed as Joseph B. Kruskal, Jr. Published in Proceedings of the American Mathematical Society 7(1), 48–50, February 1956. Received 11 April 1955.
Official article: www.ams.org/journals/proc/1956-007-01/S0002-9939-1956-0078686-7/S0002-9939-1956-0078686-7.pdf
Institutional scan: langevin.univ-tln.fr/cours/graphe/bonus/Krukskal.pdf
Cited passages: printed pp. 48–50, especially Construction A on p. 49 and the exchange argument on p. 50.

 Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook