“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 11296 |
|
||||
| Abstract: | |||||
|
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.
Download TeX format |
|||||
| back to top | |||||
