Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number

被引:2
|
作者
Department of Computer Science, University of Texas at Austin, 1 University Station C0500, Austin [1 ]
TX
78712, United States
机构
来源
Theory Comput. | 2007年 / 103-128期
关键词
D O I
10.4086/toc.2007.v003a006
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Relationships between the clique number, chromatic number, and the degree for some graphs
    Berlov S.L.
    Automatic Control and Computer Sciences, 2010, 44 (07) : 407 - 414
  • [2] Packing chromatic number versus chromatic and clique number
    Bresar, Bostjan
    Klavzar, Sandi
    Rall, Douglas F.
    Wash, Kirsti
    AEQUATIONES MATHEMATICAE, 2018, 92 (03) : 497 - 513
  • [3] Packing chromatic number versus chromatic and clique number
    Boštjan Brešar
    Sandi Klavžar
    Douglas F. Rall
    Kirsti Wash
    Aequationes mathematicae, 2018, 92 : 497 - 513
  • [4] Tight Bounds on the Clique Chromatic Number
    Joret, Gwenael
    Micek, Piotr
    Reed, Bruce
    Smid, Michiel
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (03):
  • [5] On Graph Having Clique Number α,Chromatic Number α+1
    Xu Baogang(Dept.Math.Shandong University
    数学研究与评论, 1991, (03) : 400 - 400
  • [6] The list chromatic number of graphs with small clique number
    Molloy, Michael
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 134 : 264 - 284
  • [7] Minimum Clique Number, Chromatic Number, and Ramsey Numbers
    Liu, Gaku
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [8] Forcing clique immersions through chromatic number
    Gauthier, Gregory
    Le, Tien-Nam
    Wollan, Paul
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 81 : 98 - 118
  • [9] The jump of the clique chromatic number of random graphs
    Lichev, Lyuben
    Mitsche, Dieter
    Warnke, Lutz
    RANDOM STRUCTURES & ALGORITHMS, 2023, 62 (04) : 1016 - 1034
  • [10] Fractional chromatic number and circular chromatic number for distance graphs with large clique size
    Liu, DDF
    Zhu, XD
    JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 129 - 146