𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3-Facial Coloring of Plane Graphs

✍ Scribed by Havet, Frédéric; Sereni, Jean-Sébastien; Škrekovski, Riste

Book ID
118197629
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
245 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Facial non-repetitive edge-coloring of p
Facial non-repetitive edge-coloring of plane graphs
✍ Frédéric Havet; Stanislav Jendrol'; Roman Soták; Erika Škrabul'áková 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

A sequence r 1 , r 2 , . . . , r 2n such that r i = r n+i for all 1 ≤ i ≤ n is called a repetition. A sequence S is called non-repetitive if no block (i.e. subsequence of consecutive terms of S) is a repetition. Let G be a graph whose edges are colored. A trail is called non-repetitive if the sequen

Cyclic coloring of plane graphs
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

On 3-colorings of Plane Graphs
On 3-colorings of Plane Graphs
✍ Bao-gang Xu 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB
Coloring plane graphs with independent c
Coloring plane graphs with independent crossings
✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc.