Constructions for normal graphs and some consequences

  title={Constructions for normal graphs and some consequences},
  author={Annegret Wagler},
  journal={Discrete Applied Mathematics},
Normal graphs can be considered as weaker perfect graphs in several ways. However, only few graphs are known yet to be normal, apart from perfect graphs, odd holes, and odd antiholes of length ≥ 9. Körner and de Simone [J. Körner, C. de Simone, On the odd cycles of normal graphs, Discrete Appl. Math. 94 (1999) 161–169] conjectured that every (C5, C7, C7)-free graph is normal. As there exist normal graphs containing C5, C7, or C7, it is worth looking for other ways to construct or detect normal… CONTINUE READING