✦ LIBER ✦

k-fold coloring of planar graphs

✍ Scribed by Ren, GuanFeng; Bu, YueHua

Book ID: 120796461
Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 302 KB
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-010-0083-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ GuanFeng Ren; YueHua Bu 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 296 KB

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

Additive Coloring of Planar Graphs

✍ Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński… 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 202 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