The purpose of the present paper is to provide, for all pairs of integers $(Δ,g)$ with $\D\ge 3$ and $g\ge 3$, a positive number $C(Δ, g)$ such that chromatic polynomial $P_G(q)$ of a graph $G$ with maximum degree $Δ$ and finite girth $g$ is free of zero if $|q|\ge C(Δ, g)$. Our bounds enlarge the zero-free region in the complex plane of $P_G(q)$ in comparison to previous bounds. In particular, for small values of $\D$ our estimates yield a sensible improvement on the bounds recently obtained by Jenssen, Patel and Regts in \cite{JPR}, while they coincide with those of \cite{JPR} when $Δ\to \infty$.