Clique and chromatic number of circular-perfect graphs

A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Grötschel, Lovász and Schrijver 1981). Circular-perfect graphs form a well-studied superclass of perfect graphs. We extend the above result for perfect graphs by showing that clique and chromatic number of a circular-perfect graph are computable in polynomial time as well. The results strongly rely upon Lovász's Theta function.