Slim graphs

We consider the graphs that can be obtained by deleting in a Meyniel graphG all the edges induced by an arbitrary set of nodes. These graphs will be called Slim and we prove that they are perfect. We study relations between Slim graphs and other well known classes of perfect graphs; particularly we show that the perfection of Slim graphs gives a proof to the conjecture of M. Preissmann that Meyniel graphs are locally perfect.