References
Beineke, L. W., Pippert, R. E.: The number of labeledk-dimensional trees. J. Combinatorial Theory6, 200–205 (1969).
Bromwich, T. J. I'A.: An Introduction to the Theory of Infinite Series (Second Ed.). London: Macmillan 1926.
Brown, W. G.: Historical note on a recurrent combinatorial problem. Amer. Math. Monthly72, 973–977 (1965).
Euler, L.: Novi Commentarii Academiae Scientiarum Imperialis Petropolitanae7, 13–14 (1758–1759).
Guy, R. K.: Dissecting a polygon into triangles. Bull. Malayan Math. Soc.5, 57–60 (1958). Same title, Research Paper No. 9, The University of Calgary, 1967.
Pippert, R. E., Beineke, L. W.: Characterizations of 2-dimensional trees. Chapter in The Many Facets of Graph Theory (G. Chartrand and S. F. Kapoor; eds.), pp. 250–257. Berlin-Heidelberg-New York: Springer 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beineke, L.W., Pippert, R.E. The number of labeled dissections of ak-ball. Math. Ann. 191, 87–98 (1971). https://doi.org/10.1007/BF02330563
-
Issue Date:
DOI: https://doi.org/10.1007/BF02330563