✦ LIBER ✦

Diagonal 11-coloring of plane triangulations

✍ Scribed by Oleg V. Borodin

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 150 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140609

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On Diagonally 10-Coloring Plane Triangul

On Diagonally 10-Coloring Plane Triangulations

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB

## Abstract This article shows that the vertices of a plane triangulation may be colored with 10 colors such that every pair of vertices has different colors if they are either adjacent or diagonal, that is, that they are not adjacent but are adjacent to two faces which share an edge. This improves

Simultaneous diagonal flips in plane tri

Simultaneous diagonal flips in plane triangulations

✍ Prosenjit Bose; Jurek Czyzowicz; Zhicheng Gao; Pat Morin; David R. Wood 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

## Abstract Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triangulation with __n__ ≥ 6 vertices has a simultaneous flip into a 4‐connected triangulation, and that the set of edges to be flipped can be computed in $\cal O$(__n__) time. It follows that

Generating even triangulations of the pr

Generating even triangulations of the projective plane

✍ Yusuke Suzuki; Takahiro Watanabe 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of __even‐splittings__ and __attaching octahedra__, both of which were first given by Batagelj 2

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

Grünbaum colorings of toroidal triangula

Grünbaum colorings of toroidal triangulations

✍ Michael O. Albertson; Hannah Alpert; sarah-marie belcastro; Ruth Haas 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract We prove that if __G__ is a triangulation of the torus and χ(__G__)≠5, then there is a 3‐coloring of the edges of __G__ so that the edges bounding every face are assigned three different colors. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 68–81, 2010