We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees.
Kierstead, H. A., & Rodl, V. (1996). Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discrete Mathematics, 150(1–3), 187–193. https://doi.org/10.1016/0012-365X(95)00187-2