- Tytuł:
- On generalized list colourings of graphs
- Autorzy:
-
Borowiecki, Mieczysław
Broere, Izak
Mihók, Peter - Powiązania:
- https://bibliotekanauki.pl/articles/972024.pdf
- Data publikacji:
- 1997
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
hereditary property of graphs
list colouring
vertex partition number - Opis:
-
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.
In this paper we prove some extensions of the well-known bounds for the -chromatic number to the (,k)-choice number and then an extension of Brooks' theorem. - Źródło:
-
Discussiones Mathematicae Graph Theory; 1997, 17, 1; 127-132
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł