3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
R. Nikandish, M. J. Nikmehr
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let R be a ring and I(R)∗ be the set of all left proper non-trivial ideals of R. Th…