𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Smallest Limited Vertex-to-vertex Snakes of Unit Triangles

✍ Scribed by Heiko Harborth; László Szabo; Zoltán Ujváry-Menyhárt

Book ID
110222308
Publisher
Springer
Year
1999
Tongue
English
Weight
68 KB
Volume
78
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Plane four-regular graphs with vertex-to
Plane four-regular graphs with vertex-to-vertex unit triangles
✍ Heiko Harborth 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Harborth, H., Plane four-regular graphs with vertex-to-vertex unit triangles, Discrete Mathematics 97 (1991) 219-222. For the smallest number of non-overlapping vertex-to-vertex unit triangles in the plane it is proved ~42 in general, and <3800 if additional triangles are not allowed.

On the smallest limited snake of unit di
On the smallest limited snake of unit disks
✍ Tibor Bisztriczky; Karoly Börözky; Heiko Harborth; Lothar Piepmeyer 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 202 KB

For p ¢ q, let pq = conv{p, q}, Ipql be the length ofpq and ff~ be the ray from p through q. For points p, q and r, let / (p, q, r) be the absolute measure of the angle determined by q"~ and ~ in conv(~'pu~). Thus 0 <~ /(p,q,r) <<. lz. Henceforth, let S, = {D1,..., D,} be a collection of n >i 1 clo