𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Facial Nonrepetitive Vertex Coloring of Plane Graphs

✍ Scribed by János Barát; Július Czap

Book ID
115558806
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
545 KB
Volume
74
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

3-Facial Coloring of Plane Graphs
3-Facial Coloring of Plane Graphs
✍ Havet, Frédéric; Sereni, Jean-Sébastien; Škrekovski, Riste 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 245 KB
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