𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Delone Triangulation Numbers

✍ Scribed by Piotr Mankiewicz; Carsten Schütt

Book ID
111703667
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
77 KB
Volume
111
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Proof of an Estimate for the Ap
A Simple Proof of an Estimate for the Approximation of the Euclidean Ball and the Delone Triangulation Numbers
✍ Piotr Mankiewicz; Carsten Schütt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We give a simple proof of an estimate for the approximation of the Euclidean ball by a polytope with a given number of vertices with respect to the volume of the symmetric difference metric and relatively precise estimate for the Delone triangulation numbers. We also study the same problem for a giv

On the Number of Fair Triangulations
On the Number of Fair Triangulations
✍ Han Ren; Yanpeu Liu 📂 Article 📅 2000 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 211 KB
On the Number of Fair Triangulations
On the Number of Fair Triangulations
✍ Ren, Han; Liu, Yanpeu 📂 Article 📅 2000 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 200 KB
On numbers of pseudo-triangulations
On numbers of pseudo-triangulations
✍ Ben-Ner, Moria; Schulz, André; Sheffer, Adam 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 269 KB
On the Interval Number of a Triangulated
On the Interval Number of a Triangulated Graph
✍ Thomas Andreae 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB 👁 2 views

The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect

On the number of Hamiltonian cycles in t
On the number of Hamiltonian cycles in triangulations
✍ Jan Kratochvil; Dainis Zeps 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar