Completely unimodal numberings of a simple polytope

Discrete Applied Mathematics

Volumn 20, Issue 1, 1988, Pages 69-81

  Williamson Hoke, Kathy ^a  

^a UNIVERSITY OF RICHMOND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPLETELY UNIMODAL NUMBERINGS; DUAL SIMPLICIAL POLYTOPE; SIMPLE POLYTOPE;

MATHEMATICAL TECHNIQUES;

EID: 0024014550     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(88)90042-X     Document Type: Article

References (14)

1. Long monotone paths in abstract polytopes
2. A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
3. Which spheres are shellable?
4. A hierarchy of classes of pseudo-boolean functions
5. Some results on random linear programs
6. How good is the simplex algorithm
7. The graph of an abstract polytope
8. Decomposition, shellings, and diameters of simplicial complexes and convex polyhedra
9. Cohen-Macauley complexes
10. Unimodal set-functions