From conjecture to theorem
From MaRDI portal
In this survey it is proved that triangulated graphs and their complements are perfect. Two proofs of the weak perfect graph conjecture and their polyhedral and algebraic consequences are discussed. In particular, it is shown that Lovász's proof of the weak perfect graph conjecture pointed out the fundamental role that perfect graphs play in polyhedral combinatorics.NEWLINENEWLINEFor the entire collection see [Zbl 0972.00015].
Recommendations
Cited in
(14)- A theorem of Truemper
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- Origins and genesis
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- The strong perfect graph theorem
- scientific article; zbMATH DE number 3931041 (Why is no real title available?)
- Desert island theorems
- scientific article; zbMATH DE number 4065042 (Why is no real title available?)
- A connection between a convex programming problem and the LYM property on perfect graphs
- scientific article; zbMATH DE number 2159270 (Why is no real title available?)
- Norms and perfect graphs
- scientific article; zbMATH DE number 800548 (Why is no real title available?)
- Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”
- Weakly triangulated graphs
This page was built for publication: From conjecture to theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758331)
