✦ LIBER ✦

A result on linear coloring of planar graphs

✍ Scribed by Chunli Cai; Dezheng Xie; Wenjuan Yang

Book ID: 116577158
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 170 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.07.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear 5-coloring algorithm of planar

A linear 5-coloring algorithm of planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 526 KB

New upper bounds on linear coloring of p

New upper bounds on linear coloring of planar graphs

✍ Bin Liu, Gui Zhen Liu 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 199 KB

On linear-time algorithms for five-color

On linear-time algorithms for five-coloring planar graphs

✍ Greg N. Frederickson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Coloring Powers of Planar Graphs

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

New Linear-Time Algorithms for Edge-Colo

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

✍ Richard Cole; Łukasz Kowalik 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c