✦ LIBER ✦

Generating aspect graphs for nonconvex polyhedra

✍ Scribed by S.R. Maripuri; I. Zeid

Book ID: 103043389
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 603 KB
Volume: 22
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(90)90090-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conditions for the chirality of the simp

Conditions for the chirality of the simplest nonconvex polyhedra

✍ V. I. Sokolov 📂 Article 📅 1984 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 252 KB

Direct construction of the perspective p

Direct construction of the perspective projection aspect graph of convex polyhedra

✍ John H Stewman; Kevin W Bowyer 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 168 KB

Nonconvex Representations of Plane Graph

Nonconvex Representations of Plane Graphs

✍ Battista, Giuseppe Di; Frati, Fabrizio; Patrignani, Maurizio 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

Inclusion test for general polyhedra

✍ F.R. Feito; J.C. Torres 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 580 KB

On stable set polyhedra for K1,3-free gr

On stable set polyhedra for K1,3-free graphs

✍ Rick Giles; L.E Trotter Jr. 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Generating strings for bipartite Steinha

Generating strings for bipartite Steinhaus graphs

✍ Wayne M. Dymàček; Tom Whaley 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Let b(n) be the number of bipartite Steinhaus graphs with n vertices. We show that bin) satisfies the recurrence, b(2)=2, b(3)=4, and for k>~2, b(2k+ 1)=2b(k+ 1)+ 1, b(2k) = b(k) + b(k + 1). Thus b(n) <<, ~zn -~ with equality when n is one more than a power of two. To prove this recurrence, we descr