References
E. T. Bell, Euler Algebra.Trans. Am. Math. Soc., 25 (1923), 135–154.
L. Carlitz &J. Riordan, The number of labeled two-terminal series-parallel networks.Duke Math. Journal, 23 (1956), 435–446.
A. Cayley,Collected Mathematical Papers. Cambridge, 1889–1897; Vol. 3, 242–246; Vol. 9, 202–204, 427–460; Vol. 11, 365–367; Vol. 13, 26–28.
G. W. Ford &G. E. Uhlenbeck, Combinatorial problems in the theory of graphs. I.Proc. Nat. Acad. Sci. U.S.A., 42 (1956), 122–128.
R. M. Foster, The number of series-parallel networks.Proceedings of the International Congress of Mathematicians (1950), Vol. I, 646.
F. Harary, The number of linear, directed, rooted, and connected graphs.Trans. Am. Math. Soc., 78 (1955), 445–463.
R. Otter, The number of trees.Ann. of Math., 49 (1948), 583–599.
G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.Acta. Math., 68 (1937), 145–253.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Riordan, J. The numbers of labeled colored and chromatic trees. Acta Math. 97, 211–225 (1957). https://doi.org/10.1007/BF02392398
Issue Date:
DOI: https://doi.org/10.1007/BF02392398