The chromatic number of infinite graphs - A survey

被引:9
|
作者
Peter Komjath [1 ]
机构
[1] Eotvos Lorand Univ, Dept Comp Sci, H-1518 Budapest, Hungary
关键词
Infinite graphs; Chromatic number; SUBGRAPHS;
D O I
10.1016/j.disc.2010.11.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We survey some old and new results on the chromatic number of infinite graphs. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1448 / 1450
页数:3
相关论文
共 50 条
  • [21] On the difference between chromatic number and dynamic chromatic number of graphs
    Ahadi, A.
    Akbari, S.
    Dehghan, A.
    Ghanbari, M.
    DISCRETE MATHEMATICS, 2012, 312 (17) : 2579 - 2583
  • [22] Graphs Whose Circular Chromatic Number Equals the Chromatic Number
    Xuding Zhu
    Combinatorica, 1999, 19 : 139 - 149
  • [23] CHROMATIC INDEX OF FINITE AND INFINITE GRAPHS
    BOSAK, J
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1972, 22 (02) : 272 - &
  • [24] On group chromatic number of graphs
    Lai, HJ
    Li, XW
    GRAPHS AND COMBINATORICS, 2005, 21 (04) : 469 - 474
  • [25] MONOTONE CHROMATIC NUMBER OF GRAPHS
    Saleh, Anwar
    Muthana, Najat
    Al-Shammakh, Wafa
    Alashwali, Hanaa
    INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2020, 18 (06): : 1108 - 1122
  • [26] On the harmonious chromatic number of graphs
    Araujo-Pardo, Gabriela
    Montellano-Ballesteros, Juan Jose
    Olsen, Mika
    Rubio-Montiel, Christian
    BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA, 2024, 30 (02):
  • [27] Hat chromatic number of graphs
    Bosek, Bartlomiej
    Dudek, Andrzej
    Farnik, Michal
    Grytczuk, Jaroslaw
    Mazur, Przemyslaw
    DISCRETE MATHEMATICS, 2021, 344 (12)
  • [28] Chromatic number and subtrees of graphs
    Baogang Xu
    Yingli Zhang
    Frontiers of Mathematics in China, 2017, 12 : 441 - 457
  • [29] The Robust Chromatic Number of Graphs
    Bacso, Gabor
    Patkos, Balazs
    Tuza, Zsolt
    Vizer, Mate
    GRAPHS AND COMBINATORICS, 2024, 40 (04)
  • [30] On Indicated Chromatic Number of Graphs
    S. Francis Raj
    R. Pandiya Raj
    H. P. Patil
    Graphs and Combinatorics, 2017, 33 : 203 - 219