title: Finding max clique in perfect graphs
body: <p>A fast algorithm to find the size of the largest clique in a perfect graph(this one having odd cycles with at least 1 chord) with about 100 vertices ??</p>
  
  <p>And is there any simpler method than brute force as this is a perfect graph and there should be a polynomial time solution to it. But I am not able to find the algorithm.</p>
  
  <p>Does greedy coloring give optimal coloring in all perfect graphs??</p>