Choice number of 3-colorable elementary graphs Original Research Article

We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free graphs, in view of the conjecture that this is true for every claw-free graph.