A class of weakly perfect graphs

作者：Maimani H R^*; Pournaki M R; Yassemi S

来源：Czechoslovak Mathematical Journal, 2010, 60(4): 1037-1041.

DOI：10.1007/s10587-010-0067-6

• 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.

• 出版日期2010-12