The partial list colouring conjecture due to Albertson, Grossman, and Haas (2000) states that for every $s$-choosable graph $G$ and every assignment of lists of size $t$, $1 \leq t \leq s$, to the vertices of $G$ there is an induced subgraph of $G$ on at least $\frac{t|V(G)|}{s}$ vertices which can be properly coloured from these lists. In this paper, we show that the partial list colouring conjecture holds true for certain classes of graphs like claw-free graphs, graphs with chromatic number at least $\frac{|V(G)|-1}{2}$, chordless graphs, and series-parallel graphs.
@article{10_37236_4283,
author = {Jeannette Janssen and Rogers Mathew and Deepak Rajendraprasad},
title = {Partial list colouring of certain graphs},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {3},
doi = {10.37236/4283},
zbl = {1323.05046},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4283/}
}
TY - JOUR
AU - Jeannette Janssen
AU - Rogers Mathew
AU - Deepak Rajendraprasad
TI - Partial list colouring of certain graphs
JO - The electronic journal of combinatorics
PY - 2015
VL - 22
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/4283/
DO - 10.37236/4283
ID - 10_37236_4283
ER -
%0 Journal Article
%A Jeannette Janssen
%A Rogers Mathew
%A Deepak Rajendraprasad
%T Partial list colouring of certain graphs
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/4283/
%R 10.37236/4283
%F 10_37236_4283
Jeannette Janssen; Rogers Mathew; Deepak Rajendraprasad. Partial list colouring of certain graphs. The electronic journal of combinatorics, Tome 22 (2015) no. 3. doi: 10.37236/4283
