Enumerating Dissectible Polyhedra by Their Automorphism Groups
Canadian journal of mathematics, Tome 26 (1974) no. 1, pp. 50-67

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

A dissectible polyhedron is a natural extension of a concept whose history dates back to at least 1758 and Euler [7]—the concept of a dissection of a polygon. An interesting historical survey of dissections of a polygon is given by Brown [4]. Some approaches to the classical problem have been given by Moon and Moser [9] and by Guy [8] ; the latter provides an approach which is the basis of the work in this paper. A summary of enumeration results on dissections of polygons and polyhedra by automorphism groups has been given by the authors [2].Recent extensions of the problem have been investigated in a series of papers by Brown and Tutte [3; 5; 14; 15] and b y Takeo [10; 11; 12; 13].
Beineke, L. W.; Pippert, R. E. Enumerating Dissectible Polyhedra by Their Automorphism Groups. Canadian journal of mathematics, Tome 26 (1974) no. 1, pp. 50-67. doi: 10.4153/CJM-1974-006-x
@article{10_4153_CJM_1974_006_x,
     author = {Beineke, L. W. and Pippert, R. E.},
     title = {Enumerating {Dissectible} {Polyhedra} by {Their} {Automorphism} {Groups}},
     journal = {Canadian journal of mathematics},
     pages = {50--67},
     year = {1974},
     volume = {26},
     number = {1},
     doi = {10.4153/CJM-1974-006-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-006-x/}
}
TY  - JOUR
AU  - Beineke, L. W.
AU  - Pippert, R. E.
TI  - Enumerating Dissectible Polyhedra by Their Automorphism Groups
JO  - Canadian journal of mathematics
PY  - 1974
SP  - 50
EP  - 67
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-006-x/
DO  - 10.4153/CJM-1974-006-x
ID  - 10_4153_CJM_1974_006_x
ER  - 
%0 Journal Article
%A Beineke, L. W.
%A Pippert, R. E.
%T Enumerating Dissectible Polyhedra by Their Automorphism Groups
%J Canadian journal of mathematics
%D 1974
%P 50-67
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-006-x/
%R 10.4153/CJM-1974-006-x
%F 10_4153_CJM_1974_006_x

[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

[2] 2. Beineke, L. W. and Pippert, R. E., A census of ball and disk dissections, Chapter in Graph Theory and Applications (Proceedings of the Conference on Graph Theory and Applications, May, 1972), Y. Alavi, D. R. Lick, and A. T. White, Eds. Springer-Verlag, New York, 1972, pp. 25–40. Google Scholar

[3] 3. Brown, W. G., Enumeration of non-separable planar maps, Can. J. Math. 15 (1963), 526–545. Google Scholar

[4] 4. Brown, W. G., Historial note on a recurrent combinatorial problem, Amer. Math. Monthly 72 (1965), 973–977. Google Scholar

[5] 5. Brown, W. G. and Tutte, W. T., On the enumeration of rooted non-separable planar maps, Can. J. Math. 16 (1964), 572–577. Google Scholar

[6] 6. Coxeter, H. S. M., Introduction to geometry (Wiley, New York, 1961). Google Scholar

[7] 7. Euler, L., Novi commentarii academiae scientiarum imperialis petropolitanae 7 (1758-1759), 13-14. Google Scholar

[8] 8. Guy, R. K., Dissecting a polygon into triangles, Bull. Malayan Math. Soc. 5 (1958), 57–60. Same title, Research Paper No. 9, The University of Calgary, 1967. Google Scholar

[9] 9. Moon, J. W. and Moser, L., Triangular dissections of n-gons, Can. Math. Bull. 6 (1963), 175–178. Google Scholar

[10] 10. Takeo, F., On triangulated graphs. I, Bull. Fukuoka Univ. Ed. III 10 (1960), 9–21. Google Scholar

[11] 11. Takeo, F., On triangulated graphs. II, Bull. Fukuoka Univ. Ed. III 11 (1961), 17–31. Google Scholar

[12] 12. Takeo, F., On triangulated graphs. III, Bull. Fukuoka Univ. Ed. III 13 (1963), 11–21. Google Scholar

[13] 13. Takeo, F., On triangulated graphs. IV, Bull. Fukuoka Univ. Ed. III 14 (1964), 19–30. Google Scholar

[14] 14. Tutte, W. T., A census of planar triangulations, Can. J. Math. 14 (1962), 21–38. Google Scholar

[15] 15. Tutte, W. T., A census of planar maps, Can. J. Math. 15 (1963), 249–271. Google Scholar

Cité par Sources :