ON A CLASS OF KERNEL-PERFECT AND KERNEL-PERFECT-CRITICAL GRAPHS

In this note we present a construction of a class of graphs in which e ach of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs originate from the theory of games (Von Neumann and Morg enstern). We also find criteria to distinguish kernel-perfect graphs f rom kernel-perfect-critical graphs in this class. We obtain some of th e previously known classes of kernel-perfect-critical graphs as specia l cases of the present construction given here. The construction that we give enlarges the class of kernel-perfect-critical graphs.