✦ LIBER ✦

On 3-coloring of plane triangulations

✍ Scribed by Atsuhiro Nakamoto; Katsuhiro Ota; Mamoru Watanabe

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 156 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00097-6

No coin nor oath required. For personal study only.

📜 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

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.

Diagonal coloring of the vertices of tri

Diagonal coloring of the vertices of triangulations

✍ Oleg V. Borodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## 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

Connectivity of plane triangulations

✍ Jean-Paul Laumond 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 869 KB

On covering bridged plane triangulations

On covering bridged plane triangulations with balls

✍ Victor Chepoi; Yann Vaxès 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract We show that every plane graph of diameter 2__r__ in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius __r__. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003

3-Colorability of plane hypergraphs

✍ S. G. Indzheyan 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 743 KB