On generalized list colourings of graphs
Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 127-132
Voir la notice de l'article provenant de la source Library of Science
Vizing [15] and Erdős et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both papers the choosability version of Brooks' theorem [4] was proved but the choosability version of Gallai's theorem [9] was proved independently by Thomassen [14] and by Kostochka et al. [11]. In [3] some extensions of these two basic theorems to (,k)-choosability have been proved.
Keywords:
hereditary property of graphs, list colouring, vertex partition number
@article{DMGT_1997_17_1_a8,
author = {Borowiecki, Mieczys{\l}aw and Broere, Izak and Mih\'ok, Peter},
title = {On generalized list colourings of graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {127--132},
publisher = {mathdoc},
volume = {17},
number = {1},
year = {1997},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a8/}
}
TY - JOUR AU - Borowiecki, Mieczysław AU - Broere, Izak AU - Mihók, Peter TI - On generalized list colourings of graphs JO - Discussiones Mathematicae. Graph Theory PY - 1997 SP - 127 EP - 132 VL - 17 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a8/ LA - en ID - DMGT_1997_17_1_a8 ER -
Borowiecki, Mieczysław; Broere, Izak; Mihók, Peter. On generalized list colourings of graphs. Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 127-132. http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a8/