The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
- 1 January 1984
- book chapter
- Published by Elsevier in North-Holland Mathematics Studies
- Vol. 88, 161-167
- https://doi.org/10.1016/s0304-0208(08)72931-1
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On stable set polyhedra for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1981
- Graphical properties related to minimal imperfectionDiscrete Mathematics, 1979
- Combinatorial designs related to the strong perfect graph conjectureDiscrete Mathematics, 1979
- The validity of the strong perfect-graph conjecture for (K4−e)-free graphsJournal of Combinatorial Theory, Series B, 1979
- On the perfect graph conjectureDiscrete Mathematics, 1976
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- Almost integral polyhedra related to certain combinatorial optimization problemsLinear Algebra and its Applications, 1976
- A class of facet producing graphs for vertex packing polyhedraDiscrete Mathematics, 1975
- Perfect zero–one matricesMathematical Programming, 1974
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972