In this paper the greatest $\lceil n/2\rceil$ values of $P(G;3)$ in the class of connected 3-chromatic graphs $G$ of order $n$ are found, where $P(G;\lambda)$ denotes the chromatic polynomial of~$G$.