Pages that link to "Item:Q1196197"
From MaRDI portal
The following pages link to Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197):
Displaying 14 items.
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Hirsch polytopes with exponentially long combinatorial segments (Q1675265) (← links)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
- On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes (Q1753029) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (Q2436640) (← links)
- (Q2857397) (← links)
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra (Q4005821) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- The Hirsch Conjecture Holds for Normal Flag Complexes (Q5247624) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
