A New Proof of the d-Connectedness of d-Polytopes

DOI10.4153/CMB-1989-037-5MaRDI QIDQ4710672zbMATH OpenFDO

Authors

Publication date 25 June 1992

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1989-037-5

zbMATH Keywords

\(d\)-connectedness\(d\)-polytopes

Mathematics Subject Classification ID

Connectivity (05C40) (n)-dimensional polytopes (52B11)

Recommendations

• A short proof of the \(d\)-connectedness of \(d\)-polytopes
• A new proof of Balinski's theorem on the connectivity of polytopes
• On the graph connectivity of skeleta of convex polytopes

Cited in

(7)

• 5-connected 3-polytopes are refinements of octahedra
• A property of graphs of convex polytopes
• A short proof of the \(d\)-connectedness of \(d\)-polytopes
• A new proof of Balinski's theorem on the connectivity of polytopes
• Colorful versions of the Lebesgue, KKM, and Hex theorem
• Irreducible convex sets
• Edge connectivity of the vertices of polyhedra

This page was built for publication: A New Proof of the d-Connectedness of d-Polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710672)