𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar graphs without 3-, 7-, and 8-cycles are 3-choosable

✍ Scribed by Zdeněk Dvořák; Bernard Lidický; Riste Škrekovski

Book ID
108114146
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
456 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs without 4-cycles are acycl
Planar graphs without 4-cycles are acyclically 6-choosable
✍ Weifan Wang; Min Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract A proper vertex coloring of a graph __G__=(__V, E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__={__L__(__v__)|__v__∈__V__}, there exists a proper acyclic coloring π of __G__ such that π(__v__)∈_

A not 3-choosable planar graph without 3
A not 3-choosable planar graph without 3-cycles
✍ Margit Voigt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives a color from a prescribed list L(v). G is called k-choosable if all lists L(v) have the cardinality k and G is L-list colorable for all possible assignments of such lists. Recently, Thomassen has proved tha