✦ LIBER ✦

Choosability on H-free graphs

✍ Scribed by Golovach, Petr A.; Heggernes, Pinar; van ʼt Hof, Pim; Paulusma, Daniël

Book ID: 120192656
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 156 KB
Volume: 113
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.12.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 3-choosability of triangle-free plane

On 3-choosability of triangle-free plane graphs

✍ YingQian Wang; QiJun Zhang 📂 Article 📅 2011 🏛 SP Science China Press 🌐 English ⚖ 234 KB

Choosability of K5-minor-free graphs

✍ Riste Sˇkrekovski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

On chromatic-choosable graphs

✍ Kyoji Ohba 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB

## Abstract A graph is chromatic‐choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph __G__, if we join a sufficiently large complete graph to __G__, then we obtain a chromatic‐choosable graph. As a consequence, if the chromatic number

Choosability, Edge Choosability, and Tot

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

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

Let χ l (G), χ l (G), χ l (G), and (G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. ( 1 and only if G is an odd cycle. This proves the

On Improperly Chromatic-Choosable Graphs

✍ Yan, Zhidan; Wang, Wei; Xue, Nini 📂 Article 📅 2014 🏛 Springer Japan 🌐 English ⚖ 166 KB

On the acyclic choosability of graphs

✍ Mickaël Montassier; Pascal Ochem; André Raspaud 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

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