✦ LIBER ✦

Nonflexible polyhedra with a small number of vertices

✍ Scribed by I. G. Maksimov

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 168 KB
Volume: 149
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-008-0037-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of vertices of random conv

On the number of vertices of random convex polyhedra

✍ A. Prékopa 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 936 KB

Realization of nets of convex polyhedra

Realization of nets of convex polyhedra with equiangular vertices. 5

✍ A. M. Gurin 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 963 KB

Decomposition of infinite eulerian graph

Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree

✍ François Laviolette 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 280 KB

The realization of networks of convex po

The realization of networks of convex polyhedra with equiangular vertices. 4

✍ A. M. Gurin 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 879 KB

Asymptotic Number of Triangulations with

Asymptotic Number of Triangulations with Vertices inZ2

✍ S.Yu Orevkov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Let T 2 n be the set of all triangulations of the square [0, n] 2 with all the vertices belonging to Z 2 . We show that Cn 2 <log Card T 2 n <Dn 2 . ## 1999 Academic Press Triangulations with integral vertices appear in the algebraic geometry. They are used in Viro's method of construction of real

Point-color-symmetric graphs with a prim

Point-color-symmetric graphs with a prime number of vertices

✍ Hong Zhang 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 434 KB