vix.ing · top · new · best · stats

On the shortest spanning subtree of a graph and the traveling salesman problem

1956/02/01 by Joseph B. Kruskal · 3,891 citations
Chemistry · Computer Science · Mathematics · #Advanced Graph Theory Research #Algebraic number #Chemistry #Combinatorics #Discrete mathematics #Graph #Graph theory and applications #Mathematical analysis #Mathematical optimization #Mathematics #Ring (chemistry) #Travelling salesman problem

paper · pdf · doi:10.1090/s0002-9939-1956-0078686-7

published in Proceedings of the American Mathematical Society 7(1), 48-50 (American Mathematical Society (AMS))

crossref issued 1956/02/01 · crossref published 1956/02/01 · crossref published-print 1956/02/01 · openalex publication_date 1956/02/01 · crossref created 2010/06/30 · openalex created_date 2025/10/10 · crossref deposited 2026/04/05 · openalex updated_date 2026/08/06 · crossref indexed 2026/08/07

Abstract

7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J. Levitzki, On the radical of a general ring, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 46266. 9. -, On three problems concerning nil rings, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 913-919. 10. -, On the structure of algebraic algebras and related rings, Trans. Amer. Math. Soc. vol. 74 (1953) pp. 384-409.

Cited by

Related