✦ LIBER ✦

A -choosable theorem on toroidal graphs

✍ Scribed by Li Zhang

Book ID: 113564711
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 261 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Choosability of toroidal graphs without

Choosability of toroidal graphs without short cycles

✍ Leizhen Cai; Weifan Wang; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Let __G__ be a toroidal graph without cycles of a fixed length __k__, and χ~__l__~(__G__) the list chromatic number of __G__. We establish tight upper bounds of χ~__l__~(__G__) for the following values of __k__: © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.

Every toroidal graph is acyclically 8-ch

Every toroidal graph is acyclically 8-choosable

✍ Hou, Jian Feng; Liu, Gui Zhen 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 327 KB

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

On Improperly Chromatic-Choosable Graphs

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

Choosability on H-free graphs

✍ Golovach, Petr A.; Heggernes, Pinar; van ʼt Hof, Pim; Paulusma, Daniël 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 156 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__(_