[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

On general dissections of a polygon

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

References

  1. BEINEKE, L. W. and PIPPERT, R. C.,Recent advances in graph theory. Proc. Second Czecho-slovak Symposium, Prague 1974, 441-454. Academia, Prague 1975.

  2. Beineke, L. W. andPippert, R. E.,On the enumeration of planar trees of hexagons. Glasgow Math. J.15 (1974), 131–147.

    Article  MATH  MathSciNet  Google Scholar 

  3. Brown, W. G.,Historical note on a recurrent combinatorial problem. Amer. Math. Monthly72 (1965), 973–977.

    Article  MATH  MathSciNet  Google Scholar 

  4. Comtet, L.,Analyse Combinatoire. Paris, Presses Universitaires de France, 1970, Volume 1.

    Google Scholar 

  5. Guy, R. K.,Dissecting a polygon into triangles. Bull. Malayan Math. Soc.5 (1968), 57–60.

    Google Scholar 

  6. Harary, F. andTutte, W. T.,The number plane trees with a given partition. Mathematika11 (1964), 99–101.

    Article  MATH  MathSciNet  Google Scholar 

  7. Harary, F.,Graph Theory. Addison Wesley, Reading, Massachusetts, 1969.

    Google Scholar 

  8. Harary, F. andPalmer, E. M.,Graphical Enumeration. Academic Press, New York 1973.

    MATH  Google Scholar 

  9. Harary, F., Palmer, E. M. andRead, R. C.,On the cell-growth problem for arbitrary polygons. Discrete Math.11 (1975), 371–389.

    Article  MATH  MathSciNet  Google Scholar 

  10. Klarner, D.,Cell growth problems. Canad. J. Math.19 (1967), 851–863.

    MATH  MathSciNet  Google Scholar 

  11. Motzkin, T.,Relations between hyper-surface cross-ratios and a combinatorial formula for partitions of a polygon for permanent preponderance and for non-associative products. Bull. Amer. Math. Soc.54 (1948), 352–360.

    Article  MATH  MathSciNet  Google Scholar 

  12. Polya, G.,Kombinatorische Anzahbestimmungen für Gruppen, Graphen und chemische Verbin-dungen. Acta Math.68 (1937), 142–245.

    Article  Google Scholar 

  13. Polya, G. andCarlitz, L.,Anfgabe 305 (Solution). Elem. Math.14 (1959), 14–16.

    Google Scholar 

  14. Read, R. C.,Contributions to the cell growth problem. Canad. J. Math.14 (1962), 1–20.

    MATH  MathSciNet  Google Scholar 

  15. Riordan, J.,Combinatorial Identities. J. Wiley & Sons, New York, 1968.

    MATH  Google Scholar 

  16. Sloane, N. J. A.,Handbook of Integer Sequences. Academic Press, New York, 1973.

    MATH  Google Scholar 

  17. Stanley, R.,Solutions of Problem E2315. Amer. Math. Monthly79 (1972), 908–910.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Read, R.C. On general dissections of a polygon. Aeq. Math. 18, 370–388 (1978). https://doi.org/10.1007/BF03031688

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03031688

Keywords

Navigation