✦ LIBER ✦

On chromatic-choosable graphs

✍ Scribed by Kyoji Ohba

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 70 KB
Volume: 40
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10033

No coin nor oath required. For personal study only.

✦ Synopsis

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 of a graph G is close enough to the number of vertices in G, then G is chromatic‐choosable. We also propose a conjecture related to this fact. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 130–135, 2002

📜 SIMILAR VOLUMES

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 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__(_

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

On 3-colorable non-4-choosable planar gr

On 3-colorable non-4-choosable planar graphs

✍ Voigt, M.; Wirth, B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

An L-list coloring of a graph G is a proper vertex coloring in which every vertex v gets a color from a list L(v) of allowed colors. G is called k-choosable if all lists L(v) have exactly k elements and if G is L-list colorable for all possible assignments of such lists. Verifying conjectures of Erd

Weight choosability of graphs

✍ Tomasz Bartnicki; Jarosław Grytczuk; Stanisław Niwczyk 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Suppose the edges of a graph __G__ are assigned 3‐element lists of real weights. Is it possible to choose a weight for each edge from its list so that the sums of weights around adjacent vertices were different? We prove that the answer is positive for several classes of graphs, includi

Circular choosability of graphs

✍ Xuding Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) c;l ðGÞ of a graph G and prove that they are equivalent. Then we prove that for any graph G, c;l ðGÞ ! l ðGÞ À 1. Examples are given to show