1. Choice numbers of graphs: a probabilistic approach;Alon;Combin. Probab. Comput.,1992
2. Restricted colorings of graphs;Alon,1993
3. Extremal problems on variations of graph colorings;Choi,2014
4. Coloring claw-free graphs with Δ−1 colors;Cranston;SIAM J. Discrete Math.,2013
5. D. Cranston, L. Rabern, Graphs with χ=Δ have big cliques (2013) submitted for publication, available as http://arxiv.org/pdf/1305.3526.pdf.