Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-27T01:28:59.417Z Has data issue: false hasContentIssue false
  • English
  • Français

On the enumeration of planar trees of hexagons

Published online by Cambridge University Press:  18 May 2009

L. W. Beineke  and
R. E. Pippert
L. W. Beineke
Affiliation:
Purdue University at Fort Wayne, Fort Wayne, Indiana, U.S.A.
R. E. Pippert
Affiliation:
Purdue University at Fort Wayne, Fort Wayne, Indiana, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In their paper “ The enumeration of tree-like polyhexes”, Harary and Read [6] consider structures obtained by assembling hexagons subject to certain restrictions. Their problem is introduced as a simplified hexagonal cell-growth problem.

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 15 , Issue 2 , September 1974 , pp. 131 - 147
Copyright
Copyright © Glasgow Mathematical Journal Trust 1974

References

REFERENCES

1.Beineke, L. W. and Pippert, R. E., The number of labeled dissections of a k-ball, Math. Ann. 191 (1971), 87–98.CrossRefGoogle Scholar
2.Beineke, L. W. and Pippert, R. E., A census of ball and disk dissections, Graph Theory and Applications (Alavi, Y., Lick, D. R. and White, A. T., editors) (Springer-Verlag, New York, 1972),25–40.CrossRefGoogle Scholar
3.Beineke, L. W. and Pippert, R. E., Enumerating dissectible polyhedra by their automorphism groups, Canad. J. Math. 26 (1974), 50–67.CrossRefGoogle Scholar
4.Guy, R. K., Dissecting a polygon into triangles, Bull. Malayan Math. Soc. 5 (1958), 57–60. Research Paper No. 9, The University of Calgary, 1967.Google Scholar
5.Harary, F. and Palmer, E. M., On acyclic simplicial complexes, Mathematika 15 (1968), 115–122.CrossRefGoogle Scholar
6.Harary, F. and Read, R. C., The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. 17 (1970), 1–13.CrossRefGoogle Scholar
7.Motzkin, T., Relations between hypersurface 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.CrossRefGoogle Scholar
8.Palmer, E. M., Variations of the cell growth problem, Graph Theory and Applications (Alavi, Y., Lick, D. R. and White, A. T., editors) (Springer-Verlag, New York, 1972), 215–224.CrossRefGoogle Scholar
9.Riordan, J., Combinatorial identities (New York, 1968).Google Scholar