chromatic number; clique number; weakly perfect graph
A graph is called weakly perfect if its chromatic number equals its clique number. In this note a new class of weakly perfect graphs is presented and an explicit formula for the chromatic number of such graphs is given.
 Garey, M. R., Johnson, D. S.: Computers and Intractabilitiy: A Guide to the Theory of NP-Completeness
. W. H. Freman and Company, New York (1979). MR 0519066
 West, D. B.: Introduction to Graph Theory
. Prentice Hall, Inc., Upper Saddle River, NJ (1996). MR 1367739
| Zbl 0845.05001