A Brooks' Theorem for Triangle-Free Graphs
  Let G be a triangle-free graph with maximum degree \delta(G). We show that the chromatic number \c{hi}(G) is less than 67(1 + o(1))\delta/ log \delta. 
Mohammad Shoaib Jamall
math.CO cs.DM