Abstract

We introduce new lower bounds on the clique-chromatic numbers of $G\left(n,r,s\right)$ and $G^{-}\left(n,r,s\right)$ graphs. We also prove the clique-chromatic number of $G^{-}\left(n,r,0\right)$ to be a bounded function of $n$ for each fixed $r$.

Keywords

Mathematical Subject Classification

Milestones

Authors