References
BEINEKE, L. W. and PIPPERT, R. C.,Recent advances in graph theory. Proc. Second Czecho-slovak Symposium, Prague 1974, 441-454. Academia, Prague 1975.
Beineke, L. W. andPippert, R. E.,On the enumeration of planar trees of hexagons. Glasgow Math. J.15 (1974), 131–147.
Brown, W. G.,Historical note on a recurrent combinatorial problem. Amer. Math. Monthly72 (1965), 973–977.
Comtet, L.,Analyse Combinatoire. Paris, Presses Universitaires de France, 1970, Volume 1.
Guy, R. K.,Dissecting a polygon into triangles. Bull. Malayan Math. Soc.5 (1968), 57–60.
Harary, F. andTutte, W. T.,The number plane trees with a given partition. Mathematika11 (1964), 99–101.
Harary, F.,Graph Theory. Addison Wesley, Reading, Massachusetts, 1969.
Harary, F. andPalmer, E. M.,Graphical Enumeration. Academic Press, New York 1973.
Harary, F., Palmer, E. M. andRead, R. C.,On the cell-growth problem for arbitrary polygons. Discrete Math.11 (1975), 371–389.
Klarner, D.,Cell growth problems. Canad. J. Math.19 (1967), 851–863.
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.
Polya, G.,Kombinatorische Anzahbestimmungen für Gruppen, Graphen und chemische Verbin-dungen. Acta Math.68 (1937), 142–245.
Polya, G. andCarlitz, L.,Anfgabe 305 (Solution). Elem. Math.14 (1959), 14–16.
Read, R. C.,Contributions to the cell growth problem. Canad. J. Math.14 (1962), 1–20.
Riordan, J.,Combinatorial Identities. J. Wiley & Sons, New York, 1968.
Sloane, N. J. A.,Handbook of Integer Sequences. Academic Press, New York, 1973.
Stanley, R.,Solutions of Problem E2315. Amer. Math. Monthly79 (1972), 908–910.
Author information
Authors and Affiliations
Rights 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
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF03031688