Critical perfect graphs and perfect 3-chromatic graphs |
| |
| Authors: | Alan Tucker |
| |
| Affiliation: | Department of Applied Mathematics and Statistics, SUNY at Stony Brook, Stony Brook, New York 11794 USA |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
