The strongly perfectness of normal product of \(t\)-perfect graphs (Q1376056)

Let \(G=(V,E)\) be a finite, undirected, simple graph. Its stability number be denoted by \(\alpha(G)\) and the minimal clique covering number by \(\theta(G)\). It is known that \(G\) is a perfect graph if for every induced subgraph \(H\) of \(G\) holds \(\alpha(H) = \theta (H)\). Let \(F\) be a family of subsets of a set \(M\). A subset \(T\) of \(M\) such that \(T\) intersects all elements of \(F\) is called a transversal of \(F\). If all these intersections consist of exactly one element, then \(T\) is called a perfect transversal. A perfect transversal of the set \(S(G)\) of all stable sets of a graph \(G\) is called a complete transversal of \(G\) and a perfect transversal of the set \(C(G)\) of all maximal cliques of \(G\) a stable transversal of \(G\). In particular \(G\) is called (i) \(c\)-perfect, if all its induced subgraphs have a stable transversal (such graphs are also called strongly perfect graphs), (ii) \(s\)-perfect, if all its induced subgraphs have a complete transversal, and (iii) \(t\)-perfect, if for every induced subgraph \(H\) of \(G\), \(\alpha (H)\) equals the number of maximal cliques contained in \(H\). The normal product \(G= G_1\wedge G_2=(V,E)\) of \(G_1=(V_1,E_1)\) and \(G_2= (V_2,E_2)\) is the graph, where \(V= V_1 \times V_2\) and \((x_1,x_2) \sim(y_1,y_2)\) iff \(x_1 \sim y_1\) and \(x_2=y_2\), or \(x_1= y_1\) and \(x_2\sim y_2\), or \(x_1\sim y_1\) and \(x_2\sim y_2\). In Chapter 2 a detailed characterization of the \(t\)-perfectness is given. Starting from the known result that \(G\) is \(t\)-perfect iff it is \(P_4\)- and \(C_4\)-free (Theorem 2.1), the authors prove five equivalent statements for \(G\) to be \(t\)-perfect (Theorem 2.2). By using this theorem the authors also obtain some structural statements for such graphs. Moreover it is shown that \(C(G_1\wedge G_2)= C(G_1) \times C(G_2)\) for the normal product \(G_1\wedge G_2\). Chapter 3 contains the main result of the paper. In Theorem 3.1 it is proved that the normal product of two \(t\)-perfect graphs is strongly perfect. This theorem improves the result of G. Ravindra about the perfectness of the normal product of such graphs. Finally a result of E. Mandrescu is generalized. The authors give a condition for the normal product of graphs to be \(c\)-perfect or \(s\)-perfect.