Distance Graphs with Large Chromatic Numbers and Small Clique Numbers

被引：5
|
作者：
Kupavskii, A. B. [1 ]
Raigorodskii, A. M. [1 ,2 ]
机构：
[1] Moscow Inst Phys & Technol Tech Univ, Dolgoprudnyi 141700, Moscow Oblast, Russia
[2] Moscow MV Lomonosov State Univ, Fac Mech & Math, Moscow 119992, Russia
来源：
DOKLADY MATHEMATICS | 2012年 / 85卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
SPACE;
D O I：
10.1134/S1064562412030295
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：394 / 398
页数：5
相关论文
共 50 条
  • [41] Clique Numbers of Random Subgraphs of Some Distance Graphs
    Gusev, A. S.
    PROBLEMS OF INFORMATION TRANSMISSION, 2018, 54 (02) : 165 - 175
  • [42] CLIQUE NUMBERS OF GRAPHS
    ERDOS, P
    ERNE, M
    DISCRETE MATHEMATICS, 1986, 59 (03) : 235 - 242
  • [43] More Results on Clique-chromatic Numbers of Graphs with No Long Path
    Wichianpaisarn, Tanawat
    Uiyyasathian, Chariya
    DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2013, 2014, 8845 : 185 - 190
  • [44] A Note on Graceful Graphs with Large Chromatic Numbers
    Mahmoody, Ahmad
    ARS COMBINATORIA, 2009, 90 : 423 - 424
  • [45] Tight asymptotics of clique-chromatic numbers of dense random graphs
    Demidovich, Yu.
    Zhukovskii, M.
    JOURNAL OF GRAPH THEORY, 2023, 103 (03) : 451 - 461
  • [46] On chromatic Numbers of Close-to-Kneser Distance Graphs
    Bobu, A. V.
    Kupriyanov, A. E.
    PROBLEMS OF INFORMATION TRANSMISSION, 2016, 52 (04) : 373 - 390
  • [47] A NOTE ON 2-DISTANCE CHROMATIC NUMBERS OF GRAPHS
    Okamoto, Futaba
    Zhang, Ping
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2010, 7 (01) : 5 - 9
  • [48] On chromatic numbers of close-to-Kneser distance graphs
    A. V. Bobu
    A. E. Kupriyanov
    Problems of Information Transmission, 2016, 52 : 373 - 390
  • [49] The clique numbers of regular graphs
    Punnim, N
    GRAPHS AND COMBINATORICS, 2002, 18 (04) : 781 - 785
  • [50] The Clique Numbers of Regular Graphs
    Narong Punnim
    Graphs and Combinatorics, 2002, 18 : 781 - 785
12345