prove X(G)=w(G) for interval graphs
ie: chromatic number= size of max clique
Ive been trying to think of an interesting way to order the vertices and then apply the greedy algorithm, but i havent bin able to make it work. I know w(G)<= X(G) so i just need to show w(G)=> X(G)