Geodesic
A class of weakly perfect graphs
Czechoslovak Mathematical Journal, Tome 60 (2010) no. 4, pp. 1037-1041 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
Classification : 05C17, 05C69, 11A25
Keywords: chromatic number; clique number; weakly perfect graph 
@article{CMJ_2010_60_4_a10,
     author = {Maimani, H. R. and Pournaki, M. R. and Yassemi, S.},
     title = {A class of weakly perfect graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {1037--1041},
     year = {2010},
     volume = {60},
     number = {4},
     mrnumber = {2738964},
     zbl = {1224.05376},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2010_60_4_a10/}
}
TY  - JOUR
AU  - Maimani, H. R.
AU  - Pournaki, M. R.
AU  - Yassemi, S.
TI  - A class of weakly perfect graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2010
SP  - 1037
EP  - 1041
VL  - 60
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/CMJ_2010_60_4_a10/
LA  - en
ID  - CMJ_2010_60_4_a10
ER  - 
%0 Journal Article
%A Maimani, H. R.
%A Pournaki, M. R.
%A Yassemi, S.
%T A class of weakly perfect graphs
%J Czechoslovak Mathematical Journal
%D 2010
%P 1037-1041
%V 60
%N 4
%U http://geodesic.mathdoc.fr/item/CMJ_2010_60_4_a10/
%G en
%F CMJ_2010_60_4_a10
Maimani, H. R.; Pournaki, M. R.; Yassemi, S. A class of weakly perfect graphs. Czechoslovak Mathematical Journal, Tome 60 (2010) no. 4, pp. 1037-1041. http://geodesic.mathdoc.fr/item/CMJ_2010_60_4_a10/