Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
From MaRDI portal
Publication:2857397
zbMATH Open1274.05332MaRDI QIDQ2857397FDOQ2857397
Authors: Edward D. Kim 
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001521
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- An update on the Hirsch conjecture
- Upper bounds for the diameter and height of graphs of convex polyhedra
- Diameter of polyhedra: limits of abstraction
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Paths on Polyhedra. I
- Title not available (Why is that?)
- Long Monotone Paths in Abstract Polytopes
- Polytopality and Cartesian products of graphs
Cited In (8)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
- On a counter-example to the Hirsch conjecture
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
- A counterexample to the Hirsch conjecture
- Topological prismatoids and small simplicial spheres of large diameter
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
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)
