The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where a $bull$ is the graph consisting of a $K_3$ with two pendant edges attached to two of its vertices. In this paper, for $k\geq3$, we characterize all $k$-colorable $(bull,claw)$-free graphs containing an induced cycle of length at least $6$. Moreover, we present the full characterization of all non $4$-colorable connected $(bull,claw)$-free graphs and $(bull,chair, C_5)$-free graphs, and all non $5$-colorable connected $(bull, claw, C_5)$-free graphs.