Tight Bounds on the Clique Chromatic Number

被引:0
|
作者
Joret, Gwenael [1 ]
Micek, Piotr [2 ]
Reed, Bruce [3 ]
Smid, Michiel [4 ]
机构
[1] Univ Libre Bruxelles, Comp Sci Dept, Brussels, Belgium
[2] Jagiellonian Univ, Theoret Comp Sci Dept, Krakow, Poland
[3] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada
[4] Carleton Univ, Sch Comp Sci, Ottawa, ON, Canada
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2021年 / 28卷 / 03期
基金
加拿大自然科学与工程研究理事会;
关键词
GRAPHS;
D O I
10.37236/9659
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 (Delta/log Delta). We obtain as a corollary that every n-vertex graph has clique chromatic number O (root n/log n). Both these results are tight.
引用
收藏
页数:8
相关论文
共 50 条
  • [31] Chromatic number and clique number of subgraphs of regular graph of matrix algebras
    Akbari, S.
    Aryapoor, M.
    Jamaali, M.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (07) : 2419 - 2424
  • [32] New Construction of Graphs with High Chromatic Number and Small Clique Number
    Hamid Reza Daneshpajouh
    [J]. Discrete & Computational Geometry, 2018, 59 : 238 - 245
  • [33] A COMPARISON OF BOUNDS FOR THE CHROMATIC NUMBER OF A GRAPH
    HASELGROVE, J
    SELIM, SM
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (03) : 259 - 260
  • [34] Cycles and new bounds for the chromatic number
    Cordero-Michel, Narda
    Galeana-Sanchez, Hortensia
    Goldfeder, Ilan A.
    [J]. DISCRETE MATHEMATICS, 2023, 346 (03)
  • [35] BOUNDS FOR THE HARMONIOUS CHROMATIC NUMBER OF A GRAPH
    KRASIKOV, I
    RODITTY, Y
    [J]. JOURNAL OF GRAPH THEORY, 1994, 18 (02) : 205 - 209
  • [36] UNIFIED SPECTRAL BOUNDS ON THE CHROMATIC NUMBER
    Elphick, Clive
    Wocjan, Pawel
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (04) : 773 - 780
  • [37] BOUNDS ON THE MEASURABLE CHROMATIC NUMBER OF RN
    SZEKELY, LA
    WORMALD, NC
    [J]. DISCRETE MATHEMATICS, 1989, 75 (1-3) : 343 - 372
  • [38] New bounds for the chromatic number of graphs
    Zaker, Manouchehr
    [J]. JOURNAL OF GRAPH THEORY, 2008, 58 (02) : 110 - 122
  • [39] Upper bounds of dynamic chromatic number
    Lai, HJ
    Montgomery, B
    Poon, H
    [J]. ARS COMBINATORIA, 2003, 68 : 193 - 201
  • [40] On Lower Bounds for the Chromatic Number of Spheres
    Kostina, O. A.
    [J]. MATHEMATICAL NOTES, 2019, 105 (1-2) : 16 - 27