|
A quasi-polynomial bound for the diameter of graphs of polyhedra
Author(s):
Gil
Kalai;
Daniel
J.
Kleitman
Journal:
Bull. Amer. Math. Soc.
26
(1992),
315-316.
MSC (1991):
Primary 52A25, 90C05
MathSciNet review:
1130448
Retrieve article in:
PDF
References |
Similar articles |
Additional information
References:
- [1]
- D. W. Barnette, $W_v$ paths on $3$-polytopes, J. Combin. Theory \textbf{7} (1969), 62--70. MR 248636
- [2]
- G. B. Dantzig, Linear programming and extensions, Princeton Univ. Press, Princeton, NJ \nofrills, 1963. MR 201189
- [3]
- B. Gr\"ubaum, Convex polytopes, Wiley Interscience, London, 1967. MR 226496
- [4]
- G. Kalai, Upper bounds for the diameter and height of polytopes, Discrete Comput. Geom. \textbf{7} (1992). MR 1176376
- [5]
- V. Klee and P. Kleinschmidt, The $d$-steps conjecture and its relatives, Math. Operation Research \textbf{12} (1987), 718--755. MR 913867
- [6]
- V. Klee and D. Walkup, The $d$-step conjecture for polyhedra of dimension $d<6$, Acta Math. \textbf{133} (1967), 53--78. MR 206823
- [7]
- D. G. Larman, Paths on polytopes, Proc. London Math. Soc. (3) \textbf{20} (1970), 161--178. MR 254735
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1991):
52A25, 90C05
Retrieve articles in all Journals with MSC
(1991):
52A25, 90C05
Additional Information:
DOI:
10.1090/S0273-0979-1992-00285-9
PII:
S 0273-0979(1992)00285-9
|
