  For any $r$-uniform hypergraph ${\cal H}=(V,E)$, where $r\ge 3$, let $P({\cal
H},k)$ and $P_l({\cal H},k)$ be its chromatic polynomial and list-color
function respectively, and let $\tau'({\cal H})$ be the smallest positive
integer $q$ such that $P({\cal H},k)=P_l({\cal H},k)$ holds for all $k\ge q$.
Let $\gamma({\cal H})$ denote the maximum value of $\gamma_{e}({\cal H})$ over
all edges $e$ in ${\cal H}$, where $\gamma_{e}({\cal H})$ is the number of
edges $e'\in E$ such that $|e\cap e'|=r-1$. In this article, we show that if
$2\le |E|\le 4$, then $\tau'({\cal H})\le |E|-1$; and if $|E|\ge 5$ and
$\gamma({\cal H})\le 0.8(|E|-1)$, for any $k$-assignment $L$ of ${\cal H}$ with
$k\ge 0.6(|E|-1)+0.5\gamma({\cal H})$, $P({\cal H},L)-P({\cal H},k)\ge 0.02
k^{|V|-r} \sum_{e\in E} (k-|\bigcap_{v\in e}L(v)|) $ holds, implying that
$\tau'({\cal H})\le 0.6(|E|-1)+0.5\gamma({\cal H})\le |E|-1$ when $|E|\ge 5$
and $\gamma({\cal H})\le 0.8(|E|-1)$.
