A simple way to tell a simple polytope from its graph

1988/11/01 by Gil Kalai · 52 citations
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics #Computer science #Conjecture #Graph #Mathematics #Mathematics and Applications #Philosophy #Polytope #Simple (philosophy) #Simple graph

paper · pdf · doi:10.1016/0097-3165(88)90064-7

published in Journal of Combinatorial Theory, Series A 49(2), 381-383 (Elsevier BV)

crossref issued 1988/11/01 · crossref published 1988/11/01 · crossref published-print 1988/11/01 · openalex publication_date 1988/11/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2025/11/16 · openalex updated_date 2026/08/02

Cited by

• Finding a Simple Polytope from Its Graph in Polynomial Time
• Realizations of the Associahedron and Cyclohedron
• Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
• Polyhedral combinatorics [wikipedia]
• Steinitz's theorem [wikipedia]
• Unique sink orientation [wikipedia]