{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:09Z","timestamp":1753893849698,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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 $\\Delta$ has clique chromatic number $O\\left(\\frac{\\Delta}{\\log~\\Delta}\\right)$. We obtain as a corollary that every $n$-vertex graph has clique chromatic number $O\\left(\\sqrt{\\frac{n}{\\log ~n}}\\right)$. Both these results are tight.<\/jats:p>","DOI":"10.37236\/9659","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T01:33:59Z","timestamp":1631842439000},"source":"Crossref","is-referenced-by-count":2,"title":["Tight Bounds on the Clique Chromatic Number"],"prefix":"10.37236","volume":"28","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2021,9,10]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i3p51\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i3p51\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T01:34:00Z","timestamp":1631842440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v28i3p51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,10]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/9659","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2021,9,10]]},"article-number":"P3.51"}}