A class of weakly perfect graphs
H. R. Maimani; M. R. Pournaki; S. Yassemi
Czechoslovak Mathematical Journal (2010)
- Volume: 60, Issue: 4, page 1037-1041
- ISSN: 0011-4642
Access Full Article
top
Abstract
topHow to cite
topMaimani, H. R., Pournaki, M. R., and Yassemi, S.. "A class of weakly perfect graphs." Czechoslovak Mathematical Journal 60.4 (2010): 1037-1041. <http://eudml.org/doc/196574>.
@article{Maimani2010,
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.},
author = {Maimani, H. R., Pournaki, M. R., Yassemi, S.},
journal = {Czechoslovak Mathematical Journal},
keywords = {chromatic number; clique number; weakly perfect graph; chromatic number; clique number; weakly perfect graph},
language = {eng},
number = {4},
pages = {1037-1041},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A class of weakly perfect graphs},
url = {http://eudml.org/doc/196574},
volume = {60},
year = {2010},
}
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
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 60
IS - 4
SP - 1037
EP - 1041
AB - 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.
LA - eng
KW - chromatic number; clique number; weakly perfect graph; chromatic number; clique number; weakly perfect graph
UR - http://eudml.org/doc/196574
ER -
References
top- Garey, M. R., Johnson, D. S., Computers and Intractabilitiy: A Guide to the Theory of NP-Completeness, W. H. Freman and Company, New York (1979). (1979) MR0519066
- Kubale, M., Graph Colorings, American Mathematical Society (2004). (2004) Zbl1064.05061MR2074481
- McDiarmid, C., Reed, B., 10.1002/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G, Networks 36 (2000), 114-117. (2000) MR1793319DOI10.1002/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G
- West, D. B., Introduction to Graph Theory, Prentice Hall, Inc., Upper Saddle River, NJ (1996). (1996) Zbl0845.05001MR1367739
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.