Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
From MaRDI portal
Publication:2857397
Recommendations
Cites work
- scientific article; zbMATH DE number 5938984 (Why is no real title available?)
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- An update on the Hirsch conjecture
- Diameter of polyhedra: limits of abstraction
- Long Monotone Paths in Abstract Polytopes
- Paths on Polyhedra. I
- Polytopality and Cartesian products of graphs
- Upper bounds for the diameter and height of graphs of convex polyhedra
Cited in
(8)- Topological prismatoids and small simplicial spheres of large diameter
- On a counter-example to the Hirsch conjecture
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
- A counterexample to the Hirsch conjecture
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
- Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
This page was built for publication: Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857397)