✦ LIBER ✦

On 3-colorings of Plane Graphs

✍ Scribed by Bao-gang Xu

Book ID: 106301025
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2004
Tongue: English
Weight: 162 KB
Volume: 20
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-004-0197-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polychromatic Colorings of Plane Graphs

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

Polychromatic colorings of bounded degre

Polychromatic colorings of bounded degree plane graphs

✍ Elad Horev; Roi Krakovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

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

Colorings Of Plane Graphs With No Rainbo

Colorings Of Plane Graphs With No Rainbow Faces

✍ Veselin Jungić; Daniel Král’; Riste Škrekovski 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

On 3-colorings of bipartite p-threshold

On 3-colorings of bipartite p-threshold graphs

✍ Ioan Tomescu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

Cyclic coloring of plane graphs

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

Borodin, O.V., Cyclic coloring of plane graphs, Discrete Mathematics 100 (1992) 281-289. Let G be a plane graph, and let x,(G) be the minimum number of colors to color the vertices of G so that every two of them which lie in the boundary of the same face of the size at most k, receive different colo