Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T17:27:04.769Z Has data issue: false hasContentIssue false

WEAKLY PERFECT GRAPHS ARISING FROM RINGS

Published online by Cambridge University Press:  22 March 2010

H. R. MAIMANI
Affiliation:
Mathematics Section, Department of Basic Sciences, Shahid Rajaee Teacher Training University, PO Box 16785-163, Tehran, Iran, and School of Mathematics, Institute for Research in Fundamental Sciences (IPM), PO Box 19395-5746, Tehran, Iran. e-mail: maimani@ipm.ir
M. R. POURNAKI
Affiliation:
Department of Mathematical Sciences, Sharif University of Technology, PO Box 11155-9415, Tehran, Iran, and School of Mathematics, Institute for Research in Fundamental Sciences (IPM), PO Box 19395-5746, Tehran, Iran. e-mail: pournaki@ipm.ir, http://math.ipm.ac.ir/pournaki/
S. YASSEMI
Affiliation:
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran, and School of Mathematics, Institute for Research in Fundamental Sciences (IPM), PO Box 19395-5746, Tehran, Iran. email: yassemi@ipm.ir, http://math.ipm.ac.ir/yassemi/
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2010