A note on restricted list edge-colourings
By extending the method of \textit{F. Galvin} [J. Comb. Theory, Ser. B 63, No. 1, 153--158 (1995; Zbl 0826.05026)] and using the stable marriage theorem of \textit{D. Gale} and \textit{L. S. Shapley} [Am. Math. Mon. 69, 9--15 (1962; Zbl 0109.24403)], the author proves an extension of Galvin's theorem, namely that any graph is $L$-edge-choosable if $\vert L(e)\vert \geq \chi '(G)$ and the edge-lists of no odd cycle contain a common colour.
scientific article; zbMATH DE number 7011214