✦ LIBER ✦

k-fold coloring of planar graphs

✍ Scribed by GuanFeng Ren; YueHua Bu

Book ID: 107348190
Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 296 KB
Volume: 53
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-010-3083-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring Planar Toeplitz Graphs

✍ Reinhardt Euler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Coloring Powers of Planar Graphs

✍ Agnarsson, Geir; Halldórsson, Magnús M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB

Coloring planar graphs in parallel

✍ Joan F Boyar; Howard J Karloff 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 616 KB

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

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 |_

Equitable Coloring of Sparse Planar Grap

Equitable Coloring of Sparse Planar Graphs

✍ Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 219 KB