✦ LIBER ✦

3-list-coloring planar graphs of girth 4

✍ Scribed by Jun-Lin Guo; Yue-Li Wang

Book ID: 108114287
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 263 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.12.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

3-List-Coloring Planar Graphs of Girth 5

✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch's theorem that every planar graph of girth at least 4 is 3-colorable. If 1995 Academic Press, Inc.

List 2-distance (Δ + 1)-coloring of plan

List 2-distance (Δ + 1)-coloring of planar graphs with given girth

✍ O. V. Borodin; A. O. Ivanova; T. K. Neustroeva 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 619 KB

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

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with large girth

✍ Dongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu; Lan Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 450 KB

(2 + ?)-Coloring of planar graphs with l

(2 + ?)-Coloring of planar graphs with large odd-girth

✍ Klostermeyer, William; Zhang, Cun Quan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N

Colorings and girth of oriented planar g

Colorings and girth of oriented planar graphs

✍ Jarik Nešetřil; André Raspaud; Eric Sopena 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 842 KB