𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring Powers of Planar Graphs

✍ Scribed by Agnarsson, Geir; Halldórsson, Magnús M.

Book ID
118198052
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
183 KB
Volume
16
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring Powers of Chordal Graphs
Coloring Powers of Chordal Graphs
✍ Král', Daniel 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB
Star coloring bipartite planar graphs
Star coloring bipartite planar graphs
✍ H. A. Kierstead; André Kündgen; Craig Timmons 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig

k-fold coloring of planar graphs
k-fold coloring of planar graphs
✍ GuanFeng Ren; YueHua Bu 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 296 KB
Adapted list coloring of planar graphs
Adapted list coloring of planar graphs
✍ Louis Esperet; Mickaël Montassier; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 1 views

## Abstract Given an edge coloring __F__ of a graph __G__, a vertex coloring of __G__ is __adapted to F__ if no color appears at the same time on an edge and on its two endpoints. If for some integer __k__, a graph __G__ is such that given any list assignment __L__ to the vertices of __G__, with |_