A note on partial list coloring
Moharram N. Iradmusa · 2010
Let G be a simple graph with n vertices and list chromatic number χℓ(G) = χℓ. Suppose that 0 ≤ t ≤ χℓ and each vertex of G is assigned a list of t colors. Albertson, Grossman and Haas [1] conjectured that at least tn χℓ vertices of G can be colored from these lists. In this paper we find some new results in partial list coloring which help us to show that the conjecture is true for at least half of the numbers of the set {1, 2,..., χℓ(G) − 1}. In addition we introduce a new related conjecture and finally we present some results about this conjecture.