Choice number of some complete multi-partite graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
On the choice numbers of some complete multipartite graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Information Processing Letters
| Hi-index | 0.00 |
A graph G is k-choosable if it admits avertex-coloring whenever the colors allowed at each vertex arerestricted to a list of length k. If X denotes theusual chromatic number of G, we are interested in which kindof G is X-choosable. This question contains a famousconjecture, which states that every line-graph isX-choosable. We present some other classes of graphs thatare X-choosable; all these classes are related to claw-freegraphs. © 1998 John Wiley & Sons, Inc. J Graph Theory 27:8797, 1998