Pages that link to "Item:Q1120602"
From MaRDI portal
The following pages link to A simple way to tell a simple polytope from its graph (Q1120602):
Displaying 16 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)
- Unique sink orientations of grids (Q930596) (← links)
- Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
- On the number of faces of certain transportation polytopes (Q1580679) (← 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)
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids (Q5944000) (← links)
