✦ LIBER ✦

Diagonal coloring of the vertices of triangulations

✍ Scribed by Oleg V. Borodin

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 112 KB
Volume: 102
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90352-g

No coin nor oath required. For personal study only.

✦ Synopsis

In the diagonal coloring of triangulations, not only adjacent vertices are colored differently but also any vertices z, w if there exist faces [xyz] and [WY]. An upper bound for the minimal number of colors needed to diagonally color any triangulation of a surface with

Euler characteristic N is given which is asymptotically fi times better than that due to Bouchet, Fouquet, Jolivet, and Riviere. This is conjectured to be the best possible for all surfaces except for the plane.

📜 SIMILAR VOLUMES

Diagonal 11-coloring of plane triangulat

Diagonal 11-coloring of plane triangulations

✍ Oleg V. Borodin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract The vertices of each plane triangulation without loops and multiple edges may be colored with 11 colors so that for every two adjacent triangles [__xyz__] and [__wxy__], the vertices __x__,__y__,__w__,__z__ are colored pairwise differently.

Three-coloring the vertices of a triangu

Three-coloring the vertices of a triangulated simple polygon

✍ A.A. Kooshesh; B.M.E. Moret 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 47 KB

Diagonal flips in triangulations of surf

Diagonal flips in triangulations of surfaces

✍ Seiya Negami 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 518 KB

It will be shown that any two triangulations of a closed surface can be transformed into each other by flipping diagonals in quadrilaterals if they have a sufficiently large and equal number of vertices.

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

Enumeration of Rooted Planar Triangulati

Enumeration of Rooted Planar Triangulations with Respect to Diagonal Flips

✍ Zhicheng Gao; Jianyu Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

We use the generating function approach to enumerate two families of rooted planar near-triangulations (2-connected, and 2-connected with no multiple edges) with respect to the number of flippable edges. It is shown that their generating functions are algebraic. Simple explicit expressions are obtai

Diagonal Flips of Triangulations on Clos

Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties

✍ Richard Brunet; Atsuhiro Nakamoto; Seiya Negami 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Consider a class P of triangulations on a closed surface F 2 , closed under vertex splitting. We shall show that any two triangulations with the same and sufficiently large number of vertices which belong to P can be transformed into each other, up to homeomorphism, by a finite sequence of diagonal