Diameters of Polyhedral Graphs

DOI10.4153/CJM-1964-061-2MaRDI QIDQ5733086zbMATH OpenFDO

Authors Victor Klee

Publication date 1964

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1964-061-2

zbMATH Keywords

elementary geometry

Cited in

(19)

• Regular separable graphs of minimum order with given diameter
• A family of neighborly polytopes
• Polytope pairs and their relationship to linear programming
• More polytopes meeting the conjectured Hirsch bound
• A refinement of Todd's bound for the diameter of a polyhedron
• Blending simple polytopes at faces
• An asymptotically improved upper bound on the diameter of polyhedra
• Improving bounds on the diameter of a polyhedron in high dimensions
• Heights of convex polytopes
• A class of linear programming problems requiring a large number of iterations
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Enumerating neighborly polytopes and oriented matroids
• The diameter of the ridge-graph of a cyclic polytope
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• A counterexample to the Hirsch conjecture
• Edge-graph diameter bounds for convex polytopes with few facets
• More bounds on the diameters of convex polytopes
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• Independence numbers of polyhedral graphs

This page was built for publication: Diameters of Polyhedral Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5733086)