𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Number of Fair Triangulations

✍ Scribed by Ren, Han; Liu, Yanpeu

Book ID
120091425
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2000
Tongue
English
Weight
200 KB
Volume
16
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 Delone Triangulation Numbers
On the Delone Triangulation Numbers
✍ Piotr Mankiewicz; Carsten SchΓΌtt πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 77 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 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

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