Geodesic
On Polyhedral Realizability of Certain Sequences
Canadian mathematical bulletin, Tome 12 (1969) no. 1, pp. 31-39

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

A finite sequence (pk) = (p3, p4,...) of non-negative integers shall be called realizable provided there exists a 3-valent 3-polytope P which has pi. i-gonal faces for every i. P is called a realization of (pk).For realizability of a sequence (pk), from Euler's formula follows (*) as a necessary condition. 
Jucovič, E. On Polyhedral Realizability of Certain Sequences. Canadian mathematical bulletin, Tome 12 (1969) no. 1, pp. 31-39. doi: 10.4153/CMB-1969-004-1
@article{10_4153_CMB_1969_004_1,
     author = {Jucovi\v{c}, E.},
     title = {On {Polyhedral} {Realizability} of {Certain} {Sequences}},
     journal = {Canadian mathematical bulletin},
     pages = {31--39},
     year = {1969},
     volume = {12},
     number = {1},
     doi = {10.4153/CMB-1969-004-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-004-1/}
}
TY  - JOUR
AU  - Jucovič, E.
TI  - On Polyhedral Realizability of Certain Sequences
JO  - Canadian mathematical bulletin
PY  - 1969
SP  - 31
EP  - 39
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-004-1/
DO  - 10.4153/CMB-1969-004-1
ID  - 10_4153_CMB_1969_004_1
ER  - 
%0 Journal Article
%A Jucovič, E.
%T On Polyhedral Realizability of Certain Sequences
%J Canadian mathematical bulletin
%D 1969
%P 31-39
%V 12
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-004-1/
%R 10.4153/CMB-1969-004-1
%F 10_4153_CMB_1969_004_1

[1] 1. Brückner, M., Vielecke und Vielflache. (Leipzig, 1900). Google Scholar

[2] 2. Grünbaum, B. and Motzkin, T. S., The number of hexagons and the simplicity of geodesies on certain polyhedra. Canad. J. Math. 15 (1963) 744–751. Google Scholar

[3] 3. Grünbaum, B., Convex Polytopes. (J, Wiley, 1967). Google Scholar

[4] 4. Grünbaum, B., A companion to Eberhard′s Theorem (preprint). Google Scholar

Cité par Sources :