✦ LIBER ✦

Ordinary 3-polytopes

✍ Scribed by T. Bisztriczky

Publisher: Springer
Year: 1994
Tongue: English
Weight: 607 KB
Volume: 52
Category: Article
ISSN: 0046-5755
DOI: 10.1007/bf01263601

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclic coloration of 3-polytopes

✍ Michael D. Plummer; Bjarne Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

A cyclic coloration of a planar graph G is an assignment of colors to the points of G such that for any face bounding cycle the points of f have different colors. We observe that the upper bound 2p\*(G), due to 0. Ore and M. D. Plummer, can be improved to p \* ( G ) + 9 when G is 3connected (p\* den

Face sizes of 3-polytopes

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Hamiltonian paths on 3-polytopes

✍ P.R Goodey 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Incidence-polytopes of type {6, 3, 3}

✍ Asia Ivić Weiss 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 367 KB

Hamiltonian circuits on simple 3-polytop

Hamiltonian circuits on simple 3-polytopes

✍ Jean W Butler 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Strengthening of a theorem about 3-polyt

Strengthening of a theorem about 3-polytopes

✍ E. Jucovič 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 197 KB

A. Kotzig [5] proved the following theorem (cf. B. Griinbaum [2,3,4]: Every 3-polytope has at least one edge such that the sum of valencies of its end-vertices is ~< 13. In this note we deal with improvements of this statement. Let us review first some of the notations employed: If we are given a p