Pages that link to "Item:Q1120602"

The following pages link to A simple way to tell a simple polytope from its graph (Q1120602):

Displaying 41 items.

• The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
• Colorful polytopes and graphs (Q375685) (← links)
• Minkowski decomposition of associahedra and related combinatorics (Q393729) (← links)
• The brick polytope of a sorting network (Q412257) (← links)
• Lattice congruences, fans and Hopf algebras. (Q556858) (← links)
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
• The graphicahedron (Q709258) (← links)
• Graphs, skeleta and reconstruction of polytopes (Q722351) (← links)
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
• Hyperplane arrangements with a lattice of regions (Q912387) (← links)
• A non-geometric shelling of a 3-polytope (Q919281) (← links)
• Unique sink orientations of grids (Q930596) (← links)
• Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
• Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs) (Q1092413) (← links)
• Combinatorial face enumeration in convex polytopes (Q1334609) (← links)
• Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
• On the number of faces of certain transportation polytopes (Q1580679) (← links)
• On a triangulation of the \(3\)-ball and the solid torus (Q1584316) (← links)
• On the \(k\)-systems of a simple polytope (Q1601467) (← links)
• Self-dual binary codes from small covers and simple polytopes (Q1673635) (← links)
• On the reconstruction of polytopes (Q1715999) (← links)
• Polytopality and Cartesian products of graphs (Q1932654) (← links)
• Polytopes close to being simple (Q2189745) (← links)
• The positive geometry for \(\varphi^p\) interactions (Q2283549) (← links)
• Elementary moves on lattice polytopes (Q2299641) (← links)
• A simple permutoassociahedron (Q2329174) (← links)
• A note on shellability and acyclic orientations (Q2427496) (← links)
• Random edge can be exponential on abstract cubes (Q2496719) (← links)
• Reconstructing surface triangulations by their intersection matrices (Q2516675) (← links)
• Convex polytopes without triangular faces (Q2640145) (← links)
• The permuto-associahedron revisited (Q2701007) (← links)
• Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
• Computing symmetry groups of polyhedra (Q2827288) (← links)
• A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE (Q2970178) (← links)
• (Q4518986) (← links)
• On the Monotone Upper Bound Problem (Q4818674) (← links)
• Reconstructibility of Matroid Polytopes (Q5062111) (← links)
• Cocircuit graphs and efficient orientation reconstruction in oriented matroids (Q5944000) (← links)
• Reconstructing simplicial polytopes from their graphs and affine 2-stresses (Q6165195) (← links)
• Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology (Q6642295) (← links)
• Acyclic reorientation lattices and their lattice quotients (Q6644271) (← links)