par Joret, Gwenaël 
;Micek, Piotr;Reed, Bruce;Smid, Michiel M.
Référence The electronic journal of combinatorics, 28, 3, P3.51
Publication Publié, 2021
;Micek, Piotr;Reed, Bruce;Smid, Michiel M.Référence The electronic journal of combinatorics, 28, 3, P3.51
Publication Publié, 2021
Article révisé par les pairs
| Résumé : | The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique, which is not an isolated vertex, is monochromatic. We show that every graph of maximum degree ∆ has clique chromatic number O (∆ log ∆ (√ n-vertex graph has clique chromatic number On). We obtain as a corollary that every). Both these results are tight. |
