Convex and linear orientations of polytopal graphs

Discrete and Computational Geometry

Volumn 24, Issue 2-3, 2000, Pages 421-435

  Mihalisin, J ^a   Klee, V ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034398156     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010046     Document Type: Article

References (27)

1. C.A. Athanasiadis, J. DeLoera, V. Reiner, and F. Santos, Fiber polytopes for projections between cyclic polytopes, European J. Combin. 21 (2000), 19-47.
2. C.A. Athanasiadis, P.H. Edelman, and V. Reiner, Monotone paths on polytopes, Math. Z., to appear.
3. N. Amenta and G.M. Ziegler, Deformed products and maximal shadows of polytopes, in Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, American Mathematical Society, Providence, R.I., 1999 (B. Chazelle, J.E. Goodman, and R. Pollack, eds.), pp. 57-90.
4. M.L. Balinski, On the graph structure of convex polyhedra in n-space, Pacific J. Math. 11 (1961), 431-434.
5. D. Barnette and B. Grünbaum, On Steinitz's theorem concerning convex 3-polytopes and on some properties of 3-connected graphs, The Many Facets of Graph Theory, Lecture Notes in Mathematics, vol. 110, Springer-Verlag, Berlin, 1969, pp. 27-40.
6. R. Blind and P. Mani-Levitska, On puzzles and polytope isomorphisms, Aequationes Math. 34 (1987), 287-297.
7. G. Danaraj and V. Klee, Shellings of spheres and polytopes, Duke Math. J. 41 (1974), 443-451.
8. P.H. Edelman, Ordering points by linear functionals, European J. Combin. 21 (2000), 145-152.
9. B. Gärtner, Combinatorial linear programming: geometry can help, Proc. 2nd Ẇorkshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Springer-Verlag, Berlin, 1998, pp. 82-96.
10. P. Gritzmann and V. Klee, Mathematical programming and convex geometry, in Handbook of Convex Geometry, North-Holland, Amsterdam, 1993 (P.M. Gruber and J.M. Wills, eds.), pp. 627-674.
11. B. Grünbaum, Convex Polytopes, Interscience/Wiley, London, 1967.
12. B. Grünbaum, Polytopes, graphs, and complexes, Bull. Amer. Math. Soc. 76 (1970), 1131-1202.
13. B. Grünbaum, Polytopal graphs, in Studies in Graph Theory, Part II, MAA Studies in Mathematics, vol. 12, Mathematic Association of America, Washington, D.C., 1975 (D.R. Fulkerson, ed.), pp. 201-224.
14. B. Gärtner and G. Ziegler, Randomized simplex algorithms on the Klee-Minty cubes, Combinatorica 18 (1998), 349-372.
15. W.M. Hirsch and A.J. Hoffman, Extreme varieties, concave functions and the fixed charge problem, Comm. Pure Appl. Math. 14 (1961), 355-369.
16. F. Holt and V. Klee, A proof of the strict monotone 4-step conjecture, in Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, American Mathematical Society, Providence, R.I., 1999 (B. Chazelle, J.E. Goodman, and R. Pollack, eds.), pp. 201-216.
17. G. Kalai, A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49 (1988), 381-383.
18. G. Kalai, A subexponential randomized simplex algorithm, Proc. 24th ACM Symposium on the Theory of Computing (STOC), ACM Press, New York, 1992, pp. 475-482.
19. G. Kalai, Upper bounds for the diameter and height of graphs of convex polyhedra, Discrete Comput. Geom. 8 (1992), 363-372.
20. V. Klee, Heights of convex polytopes, J. Math. Anal. Appl. 11 (1965), 176-190.
21. V. Klee and G. Minty, How good is the simplex algorithm?, in Inequalities III, Academic Press, New York, 1972 (O. Shisha, ed.), pp. 159-175.
22. J. Renegar, On the computational complexity of the first-order theory of the reals. I, II, III, J. Symbolic Comput. 13 (1992), 255-352.
23. J. Richter-Gebert, Realization Spaces of Polytopes, Springer-Verlag, Berlin, 1996.
24. E. Steinitz and H. Rademacher, Vorlesungen über die Theorie der Polyeder, Springer-Verlag, Berlin, 1934.
25. A. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, Calif., 1951.
26. M.J. Todd, The monotonic bounded Hirsch conjecture is false for dimension at least 4, Math. Oper. Res. 5 (1980), 599-601.
27. G.M. Ziegler, Lectures on Polytopes, Springer-Verlag, New York, 1994.