From conjecture to theorem

MaRDI QIDQ2758331zbMATH OpenFDO

Authors Bruce Reed

Publication date 16 April 2002

zbMATH Keywords

polyhedral combinatoricsstrong perfect graph conjectureGallai graphsweak perfect graph conjecture

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Recommendations

• Progress on perfect graphs
• scientific article; zbMATH DE number 1789914
• Weakly triangulated graphs
• scientific article; zbMATH DE number 3851153
• The strong perfect graph theorem

Cited in

(12)

• A connection between a convex programming problem and the LYM property on perfect graphs
• The strong perfect graph theorem
• Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”
• Origins and genesis
• scientific article; zbMATH DE number 800548 (Why is no real title available?)
• scientific article; zbMATH DE number 2159270 (Why is no real title available?)
• scientific article; zbMATH DE number 3931041 (Why is no real title available?)
• Desert island theorems
• scientific article; zbMATH DE number 3889566 (Why is no real title available?)
• A theorem of Truemper
• Weakly triangulated graphs
• scientific article; zbMATH DE number 4065042 (Why is no real title available?)

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)