|
We prove an extension of Galvin's theorem, namely that any graph is $\chi'$-edge-choosable if no odd cycle has a common colour in the lists of its edges.
Bibtex entry:
| AUTHOR | = | {Fleiner, Tam{\'a}s}, |
| TITLE | = | {List colourings with restricted lists}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2017}, |
| NUMBER | = | {QP-2017-01} |