Norms and perfect graphs |
| |
Authors: | S Perz S Rolewicz |
| |
Institution: | (1) Institute of Mathematics, Polish Academy of Sciences, niadeckich 8, P.O. Box 137, PL-00-950 Warszawa |
| |
Abstract: | The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect. Previous proofs of this hypothesis have used combinatorial or polyhedral methods.In this paper, the concept of norms related to graphs is used to provide an alternative proof for the weak Berge hypothesis.This is a written account of an invited lecture delivered by the second author on occasion of the 12. Symposium on Operations Research, Passau, 9.–11. 9. 1987. |
| |
Keywords: | Perfect graphs Weak Berge hypothesis |
本文献已被 SpringerLink 等数据库收录! |
|