✦ LIBER ✦

On 3-choosability of planar graphs without certain cycles

✍ Scribed by Haihui Zhang; Zhiren Sun

Book ID: 108154550
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 131 KB
Volume: 107
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.01.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on 3-choosability of planar graph

A note on 3-choosability of planar graphs without certain cycles

✍ Li Zhang; Baoyindureng Wu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Choosability and edge choosability of pl

Choosability and edge choosability of planar graphs without five cycles

✍ Weifan Wang; Ko-Wei Lih 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

## It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)-h

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

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without small cycles

✍ Mickaël Montassier; André Raspaud; Weifan Wang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

## 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 ϕ(_

Planar graphs without 3-, 7-, and 8-cycl

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

✍ Zdeněk Dvořák; Bernard Lidický; Riste Škrekovski 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without adjacent short cycles

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy