Geodesic
WEAKLY PERFECT GRAPHS ARISING FROM RINGS
Glasgow mathematical journal, Tome 52 (2010) no. 3, pp. 417-425

Voir la notice de l'article provenant de la source Cambridge

DOI

A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given.
DOI : 10.1017/S0017089510000108
Mots-clés : Primary 05C15, 05C69, 05C17, Secondary 13M05 
MAIMANI, H. R.; POURNAKI, M. R.; YASSEMI, S. WEAKLY PERFECT GRAPHS ARISING FROM RINGS. Glasgow mathematical journal, Tome 52 (2010) no. 3, pp. 417-425. doi: 10.1017/S0017089510000108
@article{10_1017_S0017089510000108,
     author = {MAIMANI, H. R. and POURNAKI, M. R. and YASSEMI, S.},
     title = {WEAKLY {PERFECT} {GRAPHS} {ARISING} {FROM} {RINGS}},
     journal = {Glasgow mathematical journal},
     pages = {417--425},
     year = {2010},
     volume = {52},
     number = {3},
     doi = {10.1017/S0017089510000108},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089510000108/}
}
TY  - JOUR
AU  - MAIMANI, H. R.
AU  - POURNAKI, M. R.
AU  - YASSEMI, S.
TI  - WEAKLY PERFECT GRAPHS ARISING FROM RINGS
JO  - Glasgow mathematical journal
PY  - 2010
SP  - 417
EP  - 425
VL  - 52
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089510000108/
DO  - 10.1017/S0017089510000108
ID  - 10_1017_S0017089510000108
ER  - 
%0 Journal Article
%A MAIMANI, H. R.
%A POURNAKI, M. R.
%A YASSEMI, S.
%T WEAKLY PERFECT GRAPHS ARISING FROM RINGS
%J Glasgow mathematical journal
%D 2010
%P 417-425
%V 52
%N 3
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089510000108/
%R 10.1017/S0017089510000108
%F 10_1017_S0017089510000108

Cité par Sources :