Decomposability of polytopes

DOI10.1007/s00454-008-9051-4zbMath1141.52015OpenAlexW2068162092MaRDI QIDQ2482208

David Yost, Krzysztof Przeslawski

Publication date: 16 April 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9051-4

zbMATH Keywords

indecomposable polytope

Mathematics Subject Classification ID

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

Related Items (6)

A linear optimization oracle for zonotope computation ⋮ Minimum number of edges of polytopes with \(2d+2\) vertices ⋮ The Excess Degree of a Polytope ⋮ Lower bound theorems for general polytopes ⋮ Extreme lower previsions ⋮ Diameter, Decomposability, and Minkowski Sums of Polytopes

Cites Work

• Decomposability of polytopes and polyhedra
• Indecomposable convex polytopes
• Indecomposable polytopes
• Irreducible convex sets
• Lectures on Polytopes
• Indecomposable Polytopes
• Decomposable convex polyhedra

This page was built for publication: Decomposability of polytopes