Norms and perfect graphs

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Jan 1990 English Publisher:Springer Science and Business Media LLCJournal:ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, volume 34, pages 13-27 (issn: 0340-9422, eissn: 1432-5217,

Copyright policy )

Authors: Szczepan Perz; Stefan Rolewicz;

doi: 10.1007/bf01415946

Norms and perfect graphs

- Summary
- Subjects
- Metrics

Abstract

Summary: 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.

Related Organizations

Polish Academy of Learning
Poland

Keywords

Graph theory, Combinatorial optimization, Polytopes and polyhedra, weak Berge hypothesis, perfect graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average