A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Partial list colouring of certain graphs
The partial list colouring conjecture due to Albertson, Grossman, and Haas  states that for every s-choosable graph G and every assignment of lists of size t, 1 t s, to the vertices of G there is an induced subgraph of G on at least 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 |V (G)|−1 2 , chordless graphs, and series-parallel graphs.fatcat:dpe25o4jdrcqjkocmx7xrehr3a