Abstract
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. Copyright © 2010 Glasgow Mathematical Journal Trust.
Cite
CITATION STYLE
APA
Maimani, H. R., Pournaki, M. R., & Yassemi, S. (2010). Weakly perfect graphs arising from rings. Glasgow Mathematical Journal, 52(3), 417–425. https://doi.org/10.1017/S0017089510000108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free