Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture
- 31 December 1983
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 44 (1) , 45-54
- https://doi.org/10.1016/0012-365x(83)90005-5
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Recent Results on The Strong Perfect Graph ConjectureNorth-Holland Mathematics Studies, 1984
- The strong perfect graph conjecture for toroifal 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
- On the strong perfect graph conjectureJournal of Combinatorial Theory, Series B, 1976
- Almost integral polyhedra related to certain combinatorial optimization problemsLinear Algebra and its Applications, 1976
- Perfect zero–one matricesMathematical Programming, 1974
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972