Name
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/s004540010046 | Discrete & Computational Geometry |
Keywords | Field | DocType |
directed graph,convex polytope | Discrete mathematics,Topology,Combinatorics,Convex set,Convex hull,Steinitz's theorem,Polytope,Convex polytope,Convex analysis,Mathematics,Polyhedral combinatorics,Acyclic orientation | Journal |
Volume | Issue | ISSN |
24 | 2-3 | 0179-5376 |
Citations | PageRank | References |
8 | 0.86 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Mihalisin | 1 | 8 | 0.86 |
| Victor Klee | 2 | 169 | 17.23 |