Convex and linear orientations of polytopal graphs

DOI10.1007/s004540010046zbMath0956.05048OpenAlexW2066215968MaRDI QIDQ1580764

Victor Klee, James Mihalisin

Publication date: 7 March 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010046

zbMATH Keywords

digraphcharacterizationconvex functionsacyclic orientation

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

The Random‐Facet simplex algorithm on combinatorial cubes, A Mihalisin-Klee theorem for fans, On the Monotone Upper Bound Problem, Enumerative problems for arborescences and monotone paths on polytope graphs, On the Holt-Klee property for oriented matroid programming, The Holt-Klee condition for oriented matroids, On the Length of Monotone Paths in Polyhedra, Discrete one-forms on meshes and applications to 3D mesh parameterization