List Set Colouring: Bounds and Algorithms
Combinatorics, Probability and Computing
Minimal paths and cycles in set systems
European Journal of Combinatorics
Application of polynomial method to on-line list colouring of graphs
European Journal of Combinatorics
Towards an on-line version of Ohba's conjecture
European Journal of Combinatorics
| Hi-index | 0.00 |
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