Diameters of Polyhedral Graphs
From MaRDI portal
Publication:5733086
DOI10.4153/CJM-1964-061-2zbMath0121.37701MaRDI QIDQ5733086
Publication date: 1964
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Improving bounds on the diameter of a polyhedron in high dimensions, Blending simple polytopes at faces, More bounds on the diameters of convex polytopes, Enumerating Neighborly Polytopes and Oriented Matroids, Heights of convex polytopes, A class of linear programming problems requiring a large number of iterations, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, The diameter of the ridge-graph of a cyclic polytope, Independence numbers of polyhedral graphs, Regular separable graphs of minimum order with given diameter, A family of neighborly polytopes, A counterexample to the Hirsch conjecture, Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets, Polytope pairs and their relationship to linear programming, A refinement of Todd's bound for the diameter of a polyhedron, The \(d\)-step conjecture for polyhedra of dimension \(d<6\), An asymptotically improved upper bound on the diameter of polyhedra, More polytopes meeting the conjectured Hirsch bound, APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
