No CrossRef data available.
Published online by Cambridge University Press: 22 March 2010
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.