A New Proof of the d-Connectedness of d-Polytopes
- 1 June 1989
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 32 (2) , 252-254
- https://doi.org/10.4153/cmb-1989-037-5
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- An Introduction to Convex PolytopesPublished by Springer Nature ,1983