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
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.
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 -
Cité par Sources :