𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum number of vertices of a simple polytope

✍ Scribed by David W. Barnette

Book ID
112888854
Publisher
The Hebrew University Magnes Press
Year
1971
Tongue
English
Weight
220 KB
Volume
10
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The vertices of the knapsack polytope
The vertices of the knapsack polytope
✍ A.C. Hayes; D.G. Larman πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 222 KB
The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
✍ Michael O. Albertson; David M. Berman πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in