Perfect graphs with noP 5 and noK 5
Authors:
- 1 June 1994
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 10 (2-4) , 179-184
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On a conjecture of bergeJournal of Combinatorial Theory, Series B, 1992
- Paw-free graphsInformation Processing Letters, 1988
- A New Property of Critical Imperfect Graphs and some ConsequencesEuropean Journal of Combinatorics, 1987
- Polynomial Algorithms for Perfect Graphs1984
- The Strong Perfect Graph Theorem for a Class of Partitionable GraphsNorth-Holland Mathematics Studies, 1984
- Graphical properties related to minimal imperfectionDiscrete Mathematics, 1979
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- Perfect zero–one matricesMathematical Programming, 1974
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972