A class of weakly perfect graphs
Hamid Reza Maimani, Mohammad Reza Pournaki, Siamak Yassemi · Czechoslovak Mathematical Journal · 2010
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.