A note on chromatic number and connectivity of infinite graphs

被引：3
|
作者：
Komjath, Peter [1 ]
机构：
[1] Eotvos Lorand Univ, Dept Comp Sci, H-1518 Budapest, Hungary
来源：
ISRAEL JOURNAL OF MATHEMATICS | 2013年 / 196卷 / 01期
关键词：
Chromatic Number; Israel Journal; London Mathematical Society; Order Preserve; Connected Subgraph;
D O I：
10.1007/s11856-012-0176-z
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Consistently there exists an uncountably chromatic graph of cardinality a"mu(1) which does not contain an uncountable infinitely connected subgraph.
引用
收藏
页码：499 / 506
页数：8
相关论文
共 50 条
  • [21] On Group Chromatic Number of Graphs
    Hong-Jian Lai
    Xiangwen Li
    Graphs and Combinatorics, 2005, 21 : 469 - 474
  • [22] Chromatic Number and Orientations of Graphs and Signed Graphs
    Qi, Hao
    Wong, Tsai-Lien
    Zhu, Xuding
    TAIWANESE JOURNAL OF MATHEMATICS, 2019, 23 (04): : 767 - 776
  • [23] A note on chromatic properties of threshold graphs
    Ries, Bernard
    de Werra, Dominique
    Zenklusen, Rico
    DISCRETE MATHEMATICS, 2012, 312 (10) : 1838 - 1843
  • [24] CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS
    刘红美
    ActaMathematicaScientia, 2006, (02) : 314 - 320
  • [25] The Chromatic Number of Joins of Signed Graphs
    Mattern, Amelia R. W.
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2723 - 2735
  • [26] The Chromatic Number of Joins of Signed Graphs
    Amelia R. W. Mattern
    Graphs and Combinatorics, 2021, 37 : 2723 - 2735
  • [27] Results on the Grundy chromatic number of graphs
    Zaker, Manouchehr
    DISCRETE MATHEMATICS, 2006, 306 (23) : 3166 - 3173
  • [28] Distance graphs with maximum chromatic number
    Barajas, Javier
    Serra, Oriol
    DISCRETE MATHEMATICS, 2008, 308 (08) : 1355 - 1365
  • [29] On the Chromatic Edge Stability Number of Graphs
    Arnfried Kemnitz
    Massimiliano Marangio
    Nazanin Movarraei
    Graphs and Combinatorics, 2018, 34 : 1539 - 1551
  • [30] THE CHROMATIC NUMBER OF RANDOM INTERSECTION GRAPHS
    Rybarczyk, Katarzyna
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (02) : 465 - 476
12345