An upper bound for the diameter of a polytope

DOI10.1016/0012-365X(74)90016-8MaRDI QIDQ1212692zbMATH OpenOpenAlexFDO

Authors D. W. Barnette

Publication date 1974

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(74)90016-8

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Cites work

• scientific article; zbMATH DE number 3509333 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• Paths on Polytopes
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)

Cited in

(16)

• The width of five-dimensional prismatoids
• A friendly smoothed analysis of the simplex method
• Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
• The Hirsch conjecture holds for normal flag complexes
• On the shadow simplex method for curved polyhedra
• Polytopes and arrangements: diameter and curvature
• A counterexample to the Hirsch conjecture
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• Transportation problems and simplicial polytopes that are not weakly vertex-decomposable
• Obstructions to weak decomposability for simplicial polytopes
• Hirsch polytopes with exponentially long combinatorial segments
• A spectral approach to polytope diameter
• Improving bounds on the diameter of a polyhedron in high dimensions
• Distance between vertices of lattice polytopes
• On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

This page was built for publication: An upper bound for the diameter of a polytope

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