Critical perfect graphs and perfect 3-chromatic graphs
- 1 August 1977
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 23 (1), 143-149
- https://doi.org/10.1016/0095-8956(77)90064-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the strong perfect graph conjectureJournal of Combinatorial Theory, Series B, 1976
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- Coloring a Family of Circular ArcsSIAM Journal on Applied Mathematics, 1975
- Perfect zero–one matricesMathematical Programming, 1974
- The Strong Perfect Graph Conjecture for Planar GraphsCanadian Journal of Mathematics, 1973
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971