  Although the chromatic number of a graph is not known in general, attempts
have been made to find good bounds for the number. Here we prove that for a
graph G with two forbidden subgraphs and maximum degree less than or equal to
2{\omega} - 3, {\chi} equals its maximum clique size. We also give examples to
show that the condition is necessary.
