Chromatic numbers of layered graphs with a bounded maximal clique

被引：0
|
作者：
Berlov S.L. [1 ]
机构：
[1] High School No. 239, St.Petersburg
来源：
Journal of Mathematical Sciences | 2011年 / 179卷 / 5期
关键词：
Russia; High School; Layered Graph; Chromatic Number; Maximal Clique;
D O I：
10.1007/s10958-011-0610-5
中图分类号：
学科分类号：
摘要：
A graph is called n-layered if the set of its vertices is a union of pairwise nonintersecting n-cliques. We estimatechromatic numbers of n-layered graphs without (n + 1)-cliques. Bibliography: 10 titles. © 2011 Springer Science+Business Media, Inc.
引用
收藏
页码：579 / 591
页数：12
相关论文
共 50 条
  • [1] Clique Chromatic Numbers of Intersection Graphs
    D. A. Zakharov
    A. M. Raigorodskii
    Mathematical Notes, 2019, 105 : 137 - 139
  • [2] Clique Chromatic Numbers of Intersection Graphs
    Zakharov, D. A.
    Raigorodskii, A. M.
    MATHEMATICAL NOTES, 2019, 105 (1-2) : 137 - 139
  • [3] Graphs with large clique-chromatic numbers
    Wichianpaisarn, Tanawat
    Uiyyasathian, Chariya
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
  • [4] CHROMATIC AND CLIQUE NUMBERS OF A CLASS OF PERFECT GRAPHS
    Fander, Mohammad Reza
    TRANSACTIONS ON COMBINATORICS, 2015, 4 (04) : 1 - 4
  • [5] Clique-chromatic Numbers of Line Graphs
    Wichianpaisarn, Tanawat
    Uiyyasathian, Chariya
    ARS COMBINATORIA, 2015, 118 : 285 - 291
  • [6] Distance Graphs with Large Chromatic Numbers and Small Clique Numbers
    Kupavskii, A. B.
    Raigorodskii, A. M.
    DOKLADY MATHEMATICS, 2012, 85 (03) : 394 - 398
  • [7] Distance graphs with large chromatic numbers and small clique numbers
    A. B. Kupavskii
    A. M. Raigorodskii
    Doklady Mathematics, 2012, 85 : 394 - 398
  • [8] The chromatic and clique numbers of random scaled sector graphs
    Díaz, J
    Sanwalani, V
    Serna, M
    Spirakis, PG
    THEORETICAL COMPUTER SCIENCE, 2005, 349 (01) : 40 - 51
  • [9] New Bounds for the Clique-Chromatic Numbers of Johnson Graphs
    Raigorodskii, A. M.
    Koshelev, M. M.
    DOKLADY MATHEMATICS, 2020, 101 (01) : 66 - 67
  • [10] New Bounds for the Clique-Chromatic Numbers of Johnson Graphs
    A. M. Raigorodskii
    M. M. Koshelev
    Doklady Mathematics, 2020, 101 : 66 - 67
12345