A Note on Restricted List Edge-Colourings
- 26 Downloads
We prove an extension of Galvin’s theorem, namely that any graph is L-edge-choosable if |L(e)|≥χ′(G) and the edge-lists of no odd cycle contain a common colour.
Mathematics Subject Classification (2010)05C15
Unable to display preview. Download preview PDF.
© János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2018