Paths on Polyhedra. I

DOI10.1137/0113062zbMath0141.21303OpenAlexW2085173432MaRDI QIDQ5516075

Victor Klee

Publication date: 1966

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0113062

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38)

Related Items

Improving bounds on the diameter of a polyhedron in high dimensions, On Hamilton decompositions of prisms over simple 3-polytopes, \(W_ v\) cycles in plane graphs, On the Monotone Upper Bound Problem, Decomposition theorems for the torus, projective plane and Klein bottle, A class of linear programming problems requiring a large number of iterations, Nonrevisiting paths on surfaces, Connectivity and \(W_v\)-paths in polyhedral maps on surfaces, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, A family of neighborly polytopes, A counterexample to the Hirsch conjecture, W\({}_ V\) paths on the torus, A proof of the strict monotone 5-step conjecture, The diameter of type \(D\) associahedra and the non-leaving-face property, The monotonic diameter of the perfect matching and shortest path polytopes, Signature classes of transportation polytopes, Unnamed Item, A geometric approach to revealed preference via Hamiltonian cycles, A refinement of Todd's bound for the diameter of a polyhedron, Monotone paths in geometric triangulations, A 2-manifold of genus 8 without the \(W_ v\)-property, The \(d\)-step conjecture for polyhedra of dimension \(d<6\), An asymptotically improved upper bound on the diameter of polyhedra, The Hirsch Conjecture Holds for Normal Flag Complexes, Adjacency on combinatorial polyhedra