Geodesic
On the enumeration of planar trees of hexagons
Glasgow mathematical journal, Tome 15 (1974) no. 2, pp. 131-147

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Beineke, L. W.; Pippert, R. E. On the enumeration of planar trees of hexagons. Glasgow mathematical journal, Tome 15 (1974) no. 2, pp. 131-147. doi: 10.1017/S0017089500002305
@article{10_1017_S0017089500002305,
     author = {Beineke, L. W. and Pippert, R. E.},
     title = {On the enumeration of planar trees of hexagons},
     journal = {Glasgow mathematical journal},
     pages = {131--147},
     year = {1974},
     volume = {15},
     number = {2},
     doi = {10.1017/S0017089500002305},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002305/}
}
TY  - JOUR
AU  - Beineke, L. W.
AU  - Pippert, R. E.
TI  - On the enumeration of planar trees of hexagons
JO  - Glasgow mathematical journal
PY  - 1974
SP  - 131
EP  - 147
VL  - 15
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002305/
DO  - 10.1017/S0017089500002305
ID  - 10_1017_S0017089500002305
ER  - 
%0 Journal Article
%A Beineke, L. W.
%A Pippert, R. E.
%T On the enumeration of planar trees of hexagons
%J Glasgow mathematical journal
%D 1974
%P 131-147
%V 15
%N 2
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002305/
%R 10.1017/S0017089500002305
%F 10_1017_S0017089500002305

[1] 1.Beineke, L. W. and Pippert, R. E., The number of labeled dissections of a k-ball, Math. Ann. 191 (1971), 87–98. Google Scholar | DOI

[2] 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. Google Scholar | DOI

[3] 3.Beineke, L. W. and Pippert, R. E., Enumerating dissectible polyhedra by their automorphism groups, Canad. J. Math. 26 (1974), 50–67. Google Scholar | DOI

[4] 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] 5.Harary, F. and Palmer, E. M., On acyclic simplicial complexes, Mathematika 15 (1968), 115–122. Google Scholar | DOI

[6] 6.Harary, F. and Read, R. C., The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. 17 (1970), 1–13. Google Scholar | DOI

[7] 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. Google Scholar | DOI

[8] 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. Google Scholar | DOI

[9] 9.Riordan, J., Combinatorial identities (New York, 1968). Google Scholar

Cité par Sources :