Every Elementary Graph is Chromatic Choosable

Nandana K Vasudevan, K Somasundaram, J Geetha

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 cl…