Edge-chromatic numbers of Mycielski graphs

In this paper, we show that the Mycielski graph M(G)M(G) of a graph GG is Class I except when G=K2G=K2.