Elementary graphs are chromatic-choosable
A graph is \emph{elementary} if its edges can be coloured with two colours so that the two edges of every induced path on three vertices receive different colours. Elementary graphs are one of the two basic classes in the Chv\'atal--Sbihi decomposition of claw-free perfect graphs; they include all line graphs of bipart...