Abstract In this paper, we present a. simple inductive proof of some recently published bounds to the chromatic polynomial of a graph.