Slim graphs |
| |
Authors: | A. Hertz |
| |
Affiliation: | (1) DMA-EPFL, 1015 Lausanne, Switzerland |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|