✦ LIBER ✦

On the Number of Fair Triangulations

✍ Scribed by Han Ren; Yanpeu Liu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2000
Tongue: English
Weight: 211 KB
Volume: 16
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s101149900027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Note – On the Number of Triangulations o

Note – On the Number of Triangulations of Planar Point Sets

✍ Raimund Seidel 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 110 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

Minimizing the Stabbing Number of Matchi

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

✍ Sándor P. Fekete; Marco E. Lübbecke; Henk Meijer 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 837 KB

Realizing the chromatic numbers of trian

Realizing the chromatic numbers of triangulations of surfaces

✍ Frank Harary; Serge Lawrencenko; Vladimir Korzhik 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Given an orientable or nonorientable closed surface S and an integer n not less than 3 and not greater than the chromatic number of S, we construct a graph admitting a triangular embedding in S and having chromatic number n. In general we follow the terminology and notation of [3].