A note on restricted list edge-colourings
type: Item
instance of: scholarly article
title: A note on restricted list edge-colourings
zbMATH Open document ID: 1424.05084
author: Tamás Feliner
published in: Combinatorica
publication date: 2019-02-01T00:00:00Z
review text: 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.
reviewed by: Ioan Tomescu
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7011214
zbMATH Keywords: restricted list edge-colourings
zbMATH Keywords: $L$-edge-choosable graph
zbMATH Keywords: odd cycle
zbMATH Keywords: stable matching
zbMATH Keywords: Galvin's theorem
zbMATH Keywords: Gale-Shapley's theorem
MaRDI profile type: Publication
full work available at URL: s00493-018-3888-9
OpenAlex ID: W2799750119
Wikidata QID: Q129979553
DOI: 10.1007/S00493-018-3888-9
description: scientific article; zbMATH DE number 7011214