Geodesic
A New Proof of the d-Connectedness of d-Polytopes
Canadian mathematical bulletin, Tome 32 (1989) no. 2, pp. 252-254

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

Balinski has shown that the graph of a d-polytope is d-connected. In this note we give a new proof of Balinski's theorem.
DOI : 10.4153/CMB-1989-037-5
Mots-clés : 1. 52A25, 2. 05C40, Convex polytope, graph, d-connected 
Brøndsted, A.; Maxwell, G. A New Proof of the d-Connectedness of d-Polytopes. Canadian mathematical bulletin, Tome 32 (1989) no. 2, pp. 252-254. doi: 10.4153/CMB-1989-037-5
@article{10_4153_CMB_1989_037_5,
     author = {Br{\o}ndsted, A. and Maxwell, G.},
     title = {A {New} {Proof} of the {d-Connectedness} of {d-Polytopes}},
     journal = {Canadian mathematical bulletin},
     pages = {252--254},
     year = {1989},
     volume = {32},
     number = {2},
     doi = {10.4153/CMB-1989-037-5},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1989-037-5/}
}
TY  - JOUR
AU  - Brøndsted, A.
AU  - Maxwell, G.
TI  - A New Proof of the d-Connectedness of d-Polytopes
JO  - Canadian mathematical bulletin
PY  - 1989
SP  - 252
EP  - 254
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1989-037-5/
DO  - 10.4153/CMB-1989-037-5
ID  - 10_4153_CMB_1989_037_5
ER  - 
%0 Journal Article
%A Brøndsted, A.
%A Maxwell, G.
%T A New Proof of the d-Connectedness of d-Polytopes
%J Canadian mathematical bulletin
%D 1989
%P 252-254
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1989-037-5/
%R 10.4153/CMB-1989-037-5
%F 10_4153_CMB_1989_037_5

[1] 1. Balinski, M., On the graph structure of convex polyhedra in n-space, Pacific J. Math. 11 (1961), 431-434. Google Scholar

[2] 2. Brondsted, A., “An introduction to convex polytopes,” Springer-Verlag, New York-Heidelberg-Berlin, 1983. Google Scholar

[3] 3. Griinbaum, B., “Convex polytopes,” John Wiley & Sons, London-New York-Sydney, 1967. Google Scholar

Cité par Sources :