Zsolt Patakfalvi

  • Citations Per Year
Learn More
A graph is called normal if its vertex set can be covered by cliques Q1, Q2, . . . , Qk and also by stable sets S1, S2, . . . , Sl, such that Si ∩ Qj 6= ∅ for every i, j. This notion is due to Körner, who introduced the class of normal graphs as an extension of the class of perfect graphs. Normality has also relevance in information theory. Here we prove,(More)
  • 1