Critical perfect graphs and perfect 3-chromatic graphs

doi:10.1016/0095-8956(77)90064-8

Journal of Combinatorial Theory, Series B

Volume 23, Issue 1, August 1977, Pages 143-149

https://doi.org/10.1016/0095-8956(77)90064-8 Get rights and content

Under an Elsevier user license

open archive

Abstract

This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.

Cited by (0)

^∗: This research was partially supported by National Science Foundation Grant MPS-7505268.