Partial list colouring of certain graphs (Q888600)

Summary: The partial list colouring conjecture due to \textit{M. O. Albertson} et al. [Discrete Math. 214, No. 1--3, 235--240 (2000; Zbl 0957.05037)] 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.