A Note on Partial List Colorings

Details A Note on Partial List Colorings A Note on Partial List Colorings

2008-05-21

arxiv.org/abs/0805.3277v1

Mathematics

Combinatorics

6pages

Scientific paper

Let $G$ be a simple graph with $n$ vertices and list chromatic number $\chi_\ell(G)=\chi_\ell$. Suppose that $0\leq t\leq \chi_\ell$ and each vertex of $G$ is assigned a list of $t$ colors. Albertson, Grossman and Haas [1] conjectured that at least $\frac{tn}{\chi_\ell}$ 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,...,\chi_\ell(G)-1\}$. In addition we introduce a new related conjecture and finally we present some results about this conjecture.

Affiliated with

Also associated with

No associations

Rating

A Note on Partial List Colorings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on Partial List Colorings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Partial List Colorings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290266