Mathematische Annalen

, Volume 191, Issue 2, pp 87–98 | Cite as

The number of labeled dissections of ak-ball

  • L. W. Beineke
  • R. E. Pippert
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beineke, L. W., Pippert, R. E.: The number of labeledk-dimensional trees. J. Combinatorial Theory6, 200–205 (1969).MathSciNetGoogle Scholar
  2. 2.
    Bromwich, T. J. I'A.: An Introduction to the Theory of Infinite Series (Second Ed.). London: Macmillan 1926.Google Scholar
  3. 3.
    Brown, W. G.: Historical note on a recurrent combinatorial problem. Amer. Math. Monthly72, 973–977 (1965).MATHMathSciNetGoogle Scholar
  4. 4.
    Euler, L.: Novi Commentarii Academiae Scientiarum Imperialis Petropolitanae7, 13–14 (1758–1759).Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar

Copyright information

© Springer-Verlag 1971

Authors and Affiliations

  • L. W. Beineke
    • 1
  • R. E. Pippert
    • 1
  1. 1.Department of MathematicsPurdue University at Fort WayneFort WayneUSA

Personalised recommendations