Abstract
This paper examines directed graphs related to convex polytopes. For each fixed d-polytope and any acyclic orientation of its graph, we prove there exist both convex and concave functions that induce the given orientation. For each combinatorial class of 3-polytopes, we provide a good characterization of the orientations that are induced by an affine function acting on some member of the class.
Cite
CITATION STYLE
APA
Mihalisin, J., & Klee, V. (2000). Convex and linear orientations of polytopal graphs. Discrete and Computational Geometry, 24(2–3), 421–435. https://doi.org/10.1007/s004540010046
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free