  A number of famous results about triangle-free graphs determine the maximum
chromatic number of graphs of order n with minimum degree greater than n/3. In
this note these results are extended to Kr-free graphs.
