Maximal elements of support.
A class of weakly perfect graphs
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.
The singular sets of a complex of modules.
Page 1