✦ LIBER ✦

On Improperly Chromatic-Choosable Graphs

✍ Scribed by Yan, Zhidan; Wang, Wei; Xue, Nini

Book ID: 125345641
Publisher: Springer Japan
Year: 2014
Tongue: English
Weight: 166 KB
Volume: 31
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-014-1438-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A -choosable theorem on toroidal graphs

✍ Li Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 261 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

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

Choosability and fractional chromatic nu

Choosability and fractional chromatic numbers

✍ N. Alon; Zs. Tuza; M. Voigt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Circular consecutive choosability of k-c

Circular consecutive choosability of k-choosable graphs

✍ Daphne Liu,; Serguei Norine,; Zhishi Pan;; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

Let S(r ) denote a circle of circumference r. The circular consecutive choosability ch cc (G) of a graph G is the least real number t such that