Constructions for normal graphs and some consequences
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. Krner and de Simone [J. Krner, C. de Simone, On the odd cycles of normal graphs, Discrete Appl. Math. 94 (1999) 161169] conjectured that every ( C 5 , C 7 , C  7 )-free graph is normal. As there exist normal graphs containing C5 C 5 , C7 C 7 , or C  7 , it is worth looking for other ways to construct or detect normal graphs. For that, we treat the behavior of normal graphs under certain construction techniques (substitution, composition, and clique identification), providing several ways to construct new normal graphs from normal and even not normal ones, and consider the corresponding structural decompositions (homogeneous sets, skew partitions, and clique cutsets). Our results imply that normal graphs cannot be characterized by means of decomposition techniques as well as by forbidden subgraphs. We address negative consequences for the algorithmic behavior of normal graphs, reflected by the fact that neither the imperfection ratio can be bounded for normal graphs nor a ? ? -binding function exists. The latter is even true for the class of ( C 5 , C 7 , C  7 )-free graphs and related classes. We conclude that normal graphs are indeed only normal.
normal graphs perfect graphs imperfection ratio