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):
Displayed 15 items.
- Lattice congruences, fans and Hopf algebras. (Q556858) (← 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)
- 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)
- A note on shellability and acyclic orientations (Q2427496) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- Convex polytopes without triangular faces (Q2640145) (← links)
- On the Monotone Upper Bound Problem (Q4818674) (← links)
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids (Q5944000) (← links)