Every Elementary Graph is Chromatic Choosable

Abstract

Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced $P_3$ get distinct colors. They constitute a subclass of the class of claw-free perfect graphs. In this paper, we show that for any elementary graph, its list chromatic number and chromatic number are equal.