An Upper bound on the chromatic number of circle graphs without $K_4$
  Let $G$ be a circle graph without clique on 4 vertices. We prove that the chromatic number of $G$ doesn't exceed 30. 
G. V. Nenashev
math.CO