  Here we prove that a graph without some three induced subgraphs has chromatic
number at the most equal to its maximum clique size plus one. Further we show
that the bounds are tight and give examples to show that each of the three
forbidden subgraphs is necessary in the hypothesis.
