Independent Sets and Chromatic Numbers of Circle Graphs

被引:0
作者
Berlov S.L. [1 ]
机构
[1] Yaroslavl’ State University, Yaroslavl’
关键词
Positive Integer; Chromatic Number; Induction Step; Arbitrary Order; Maximum Clique;
D O I
10.1007/s10958-014-2196-1
中图分类号
学科分类号
摘要
Let the vertices of a circle graph be divided into several groups. This paper contains lower bounds on the size of an independent set that can be contained in one group of this subdivision. Bibliography: 7 titles. © 2014, Springer Science+Business Media New York.
引用
收藏
页码:181 / 184
页数:3
相关论文
共 50 条
[31]   Topological connectedness and independent sets in graphs [J].
Haxell, Penny .
SURVEYS IN COMBINATORICS 2019, 2019, 456 :89-113
[32]   Independent sets and matchings in subcubic graphs [J].
Henning, Michael A. ;
Loewenstein, Christian ;
Rautenbach, Dieter .
DISCRETE MATHEMATICS, 2012, 312 (11) :1900-1910
[33]   Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth [J].
Sagdeev, A. A. .
MATHEMATICAL NOTES, 2017, 101 (3-4) :515-528
[34]   A bound on measurable chromatic numbers of locally finite Borel graphs [J].
Conley, Clinton T. ;
Miller, Benjamin D. .
MATHEMATICAL RESEARCH LETTERS, 2016, 23 (06) :1633-1644
[35]   Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs [J].
Catherine Greenhill ;
Oleg Pikhurko .
Graphs and Combinatorics, 2005, 21 :407-419
[36]   On (n, m)-chromatic numbers of graphs with bounded sparsity parameters [J].
Das, Sandip ;
Lahiri, Abhiruk ;
Nandi, Soumen ;
Sen, Sagnik ;
Taruni, S. .
DISCRETE APPLIED MATHEMATICS, 2024, 358 :417-428
[37]   Chromatic numbers of Cayley graphs of abelian groups: A matrix method [J].
Cervantes, Jonathan ;
Krebs, Mike .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 676 :277-295
[38]   On Large Subgraphs with Small Chromatic Numbers Contained in Distance Graphs [J].
Kokotkin A. ;
Raigorodskii A. .
Journal of Mathematical Sciences, 2016, 214 (5) :665-674
[39]   Lower bounds for the chromatic numbers of distance graphs with large girth [J].
A. A. Sagdeev .
Mathematical Notes, 2017, 101 :515-528
[40]   Improved upper bound for the degenerate and star chromatic numbers of graphs [J].
Jiansheng Cai ;
Xueliang Li ;
Guiying Yan .
Journal of Combinatorial Optimization, 2017, 34 :441-452