2 - Trees
Published online by Cambridge University Press: 05 June 2012
Edited by
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Graph Algorithms , pp. 29 - 45Publisher: Cambridge University PressPrint publication year: 2011
References
[1] , “Shortest Connection Networks and Some Generalizations,” Bell System Tech. J., Vol. 36, 1957, pp. 1389–1401.CrossRefGoogle Scholar
[2] , “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proc. of the Amer. Math. Society, Vol. 7, 1956, pp. 48–50.CrossRefGoogle Scholar
[3] , “A Theorem on Trees,” Quart. J. Math., Vol. 23, pp. 376–378. Also in Collected Papers, Vol. 13, Cambridge, 1897, pp. 26–28.Google Scholar
[4] , “Neuer Beweise eines Satzes über Permutationen,” Arch. Math. Phys., Vol. 27, 1918, pp. 742–744.Google Scholar
[5] , “Various Proofs of Cayley's Formula for Counting Trees,” A Seminar on Graph Theory, (ed.), and , 1967, pp. 70–78.
[7] , Theorie der endlichen und unendlichen Graphen, Liepzig, 1936. Reprinted by Chelsea, 1950.Google Scholar
[8] , “Proving Theorems by Pattern Recognition,” Bell System Tech. J., Vol. 40, 1961, pp. 1–41.CrossRefGoogle Scholar