  We present a simpler proof of a bound on the number of proper colorings of a
graph that was obtained recently by Liu and Murty using Tur'an sieve (in fact,
we prove a stronger inequality). We also point out that these results are
subsumed in a stronger result due to Lazebnik in 1990.
