ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2019: 0.600
Rejection Rate (2018-2019): c. 84%
Discussiones Mathematicae Graph Theory 17(1) (1997)
Institute of Mathematics
Technical University of Zielona Góra
Podgórna 50, 65-246 Zielona Góra, Poland
Department of Mathematics
Rand Afrikaans University
P.O. Box 524, Auckland Park, 2006 South Africa
Mathematical Institute of Slovak Academy of Sciences
Grešákova 6, 040 01 Košice, Slovakia
Vizing  and Erdős et al.  independently introduce the idea of considering
list-colouring and k-choosability. In the both papers the choosability version of Brooks'
theorem  was proved but the choosability version of Gallai's theorem  was proved
independently by Thomassen  and by Kostochka et al. . In  some extensions of
these two basic theorems to (P,k)-choosability have been proved.
In this paper we prove some extensions of the well-known bounds for the P-chromatic
number to the (P,k)-choice number and then an extension of
Keywords: hereditary property of graphs, list colouring, vertex partition
1991 Mathematics Subject Classification: 05C15, 05C70.