1. A class of weakly perfect graphs
- Creator:
- Maimani, H. R., Pournaki, M. R., and Yassemi, S.
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- chromatic number, clique number, and weakly perfect graph
- Language:
- English
- Description:
- 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.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public