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 条
  • [21] On clique-inverse graphs of graphs with bounded clique number
    Alcon, Liliana
    Gravier, Sylvain
    Sales, Claudia L.
    Protti, Fabio
    Ravenna, Gabriela
    JOURNAL OF GRAPH THEORY, 2020, 94 (04) : 531 - 538
  • [22] The clique numbers of regular graphs
    Punnim, N
    GRAPHS AND COMBINATORICS, 2002, 18 (04) : 781 - 785
  • [23] The Clique Numbers of Regular Graphs
    Narong Punnim
    Graphs and Combinatorics, 2002, 18 : 781 - 785
  • [24] Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
    Conte, Alessio
    Grossi, Roberto
    Marino, Andrea
    Versari, Luca
    ALGORITHMICA, 2020, 82 (06) : 1547 - 1573
  • [25] Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
    Alessio Conte
    Roberto Grossi
    Andrea Marino
    Luca Versari
    Algorithmica, 2020, 82 : 1547 - 1573
  • [26] Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
    de Menibus, Benjamin Hellouin
    Uno, Takeaki
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 483 - 494
  • [27] On the structure of graphs with bounded clique number
    Brandt, S
    COMBINATORICA, 2003, 23 (04) : 693 - 696
  • [28] Maximal Clique Search in Weighted Graphs
    Yu, Dongxiao
    Zhang, Lifang
    Luo, Qi
    Cheng, Xiuzhen
    Cai, Zhipeng
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (09) : 9421 - 9432
  • [29] The jump of the clique chromatic number of random graphs
    Lichev, Lyuben
    Mitsche, Dieter
    Warnke, Lutz
    RANDOM STRUCTURES & ALGORITHMS, 2023, 62 (04) : 1016 - 1034
  • [30] Circular chromatic numbers and fractional chromatic numbers of distance graphs
    Chang, GJ
    Huang, LL
    Zhu, XD
    EUROPEAN JOURNAL OF COMBINATORICS, 1998, 19 (04) : 423 - 431
12345