Eugen Mandrescu: On the co-strong perfectness of the normal product of graphs, 421-430

Abstract:

A graph $G$ is strongly perfect if every induced subgraph $H$ has an independent set meeting all the maximal cliques of $H$ [4]. If both $G$ and its complement are strongly perfect, then $G$ is a co-strongly perfect graph. Co-strongly perfect graphs were first studied in [22].

In this paper we present a number of necessary/sufficient conditions concerning the co-strong perfectness of the normal product of graphs.

Key Words: Perfect graph, strongly perfect graph, normal product of graphs.

2010 Mathematics Subject Classification: Primary 05C17; Secondary 05C76.

Download the paper in pdf format here.