A short proof of the \(d\)-connectedness of \(d\)-polytopes

DOI10.1016/0012-365X(93)E0134-PzbMath0812.05040WikidataQ127719869 ScholiaQ127719869MaRDI QIDQ1343799

D. W. Barnette

Publication date: 12 March 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectednessconvex polytopes\(d\)-connectedgraph of a \(d\)-polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Connectivity (05C40)

Related Items (1)

A new proof of Balinski's theorem on the connectivity of polytopes

Cites Work

• On the graph structure of convex polyhedra in \(n\)-space
• Graph theorems for manifolds
• A New Proof of the d-Connectedness of d-Polytopes

This page was built for publication: A short proof of the \(d\)-connectedness of \(d\)-polytopes