✦ LIBER ✦

Colorings Of Plane Graphs With No Rainbow Faces

✍ Scribed by Veselin Jungić; Daniel Král’; Riste Škrekovski

Book ID: 106167588
Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 224 KB
Volume: 26
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-006-0012-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rainbow faces in edge-colored plane grap

Rainbow faces in edge-colored plane graphs

✍ Stanislav Jendrol'; Jozef Miškuf; Roman Soták; Erika Škrabul'áková 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A face of an edge‐colored plane graph is called __rainbow__ if the number of colors used on its edges is equal to its size. The maximum number of colors used in an edge coloring of a connected plane graph __G__with no rainbow face is called __the edge‐rainbowness__ of __G__. In this pap

Maximum Face-Constrained Coloring of Pla

Maximum Face-Constrained Coloring of Plane Graphs

✍ Radhika Ramamurthi; Douglas B. West 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Polychromatic Colorings of Plane Graphs

✍ Noga Alon; Robert Berke; Kevin Buchin; Maike Buchin; Péter Csorba; Saswata Shann 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 546 KB

Non-rainbow colorings of 3-, 4- and 5-co

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs

✍ Zdeněk Dvořák; Daniel Král'; Riste Škrekovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If __G__ is a 3 ‐connected plane graph with __n__ vertices, then the number of colors in such a coloring does not exceed $\lfloor{{7n-8}\over {9}}\rfloo

Edge-face coloring of plane graphs with

Edge-face coloring of plane graphs with maximum degree nine

✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max

On 3-colorings of Plane Graphs

✍ Bao-gang Xu 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB