Back to Search
Start Over
A Note on Restricted List Edge-Colourings.
- Source :
- Combinatorica; Oct2018, Vol. 38 Issue 5, p1265-1267, 3p
- Publication Year :
- 2018
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02099683
- Volume :
- 38
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Combinatorica
- Publication Type :
- Academic Journal
- Accession number :
- 133453242
- Full Text :
- https://doi.org/10.1007/s00493-018-3888-9