Geodesic
Generalized list colourings of graphs
Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 2, pp. 185-193.

Voir la notice de l'article provenant de la source Library of Science

We prove: (1) that ch_P(G) - χ_P(G) can be arbitrarily large, where ch_P(G) and χ_P(G) are P-choice and P-chromatic numbers, respectively, (2) the (P,L)-colouring version of Brooks' and Gallai's theorems.
Keywords: hereditary property of graphs, list colouring, vertex partition number 
@article{DMGT_1995_15_2_a5,
     author = {Borowiecki, Mieczys{\l}aw and Drgas-Burchardt, Ewa and Mih\'ok, Peter},
     title = {Generalized list colourings of graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {185--193},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {1995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a5/}
}
TY  - JOUR
AU  - Borowiecki, Mieczysław
AU  - Drgas-Burchardt, Ewa
AU  - Mihók, Peter
TI  - Generalized list colourings of graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1995
SP  - 185
EP  - 193
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a5/
LA  - en
ID  - DMGT_1995_15_2_a5
ER  - 
%0 Journal Article
%A Borowiecki, Mieczysław
%A Drgas-Burchardt, Ewa
%A Mihók, Peter
%T Generalized list colourings of graphs
%J Discussiones Mathematicae. Graph Theory
%D 1995
%P 185-193
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a5/
%G en
%F DMGT_1995_15_2_a5
Borowiecki, Mieczysław; Drgas-Burchardt, Ewa; Mihók, Peter. Generalized list colourings of graphs. Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 2, pp. 185-193. http://geodesic.mathdoc.fr/item/DMGT_1995_15_2_a5/

[1] M. Borowiecki and P. Mihók, Hereditary Properties of Graphs, in: Advances in Graph Theory (Vishwa International Publications, 1991) 41-68.

[2] R.L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941) 194-197, doi: 10.1017/S030500410002168X.

[3] P. Erdős, A.L. Rubin and H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combin., Graph Theory and Computing, Congressus Numerantium XXVI (1979) 125-157.

[4] T. Gallai, Kritiche Graphen I, Publ. Math. Inst. Hung. Acad. Sci. 8 (1963) 373-395.

[5] F. Harary, Graph Theory (Addison Wesley, Reading, Mass. 1969).

[6] V.G. Vizing, Colouring the vertices of a graph in prescribed colours (in Russian), Diskret. Analiz 29 (1976) 3-10.