
theorem :: ChrComplClico:
for G being SimpleGraph, C being Coloring of Complement G
  holds C is Clique-partition of G
proof
 let G be SimpleGraph, C being Coloring of Complement G;
   Complement Complement G = G;
 hence thesis by Th80;
end;
