1 paper · 1 filter
Peter J. Cameron, Veronica Phan
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group G is weakly perfect: its clique number and…