Abstract
Abstract
For a finite group G, let
$\Delta (G)$
denote the character graph built on the set of degrees of the irreducible complex characters of G. A perfect graph is a graph
$\Gamma $
in which the chromatic number of every induced subgraph
$\Delta $
of
$\Gamma $
equals the clique number of
$\Delta $
. We show that the character graph
$\Delta (G)$
of a finite group G is always a perfect graph. We also prove that the chromatic number of the complement of
$\Delta (G)$
is at most three.
Publisher
Cambridge University Press (CUP)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献