COLORING RANDOM GRAPHS

被引：197
|
作者：
GRIMMETT, GR [1 ]
MCDIARMID, CJH [1 ]
机构：
[1] MATH INST,OXFORD,ENGLAND
来源：
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY | 1975年 / 77卷 / MAR期
关键词：
D O I：
10.1017/S0305004100051124
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：313 / 324
页数：12
相关论文
共 50 条
  • [21] Algorithms for coloring semi-random graphs
    Subramanian, CR
    Furer, M
    Madhavan, CEV
    RANDOM STRUCTURES & ALGORITHMS, 1998, 13 (02) : 125 - 158
  • [22] Effect of quantum fluctuations on the coloring of random graphs
    Bapst, Victor
    Semerjian, Guilhem
    Zamponi, Francesco
    PHYSICAL REVIEW A, 2013, 87 (04):
  • [23] FAST PARALLEL ALGORITHMS FOR COLORING RANDOM GRAPHS
    KEDEM, ZM
    PALEM, KV
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 135 - 147
  • [24] COLORING RANDOM INTERSECTION GRAPHS AND COMPLEX NETWORKS
    Behrisch, Michael
    Taraz, Anusch
    Ueckerdt, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (01) : 288 - 299
  • [25] Coloring random graphs and maximizing local diversity
    Bounkong, S.
    van Mourik, J.
    Saad, D.
    PHYSICAL REVIEW E, 2006, 74 (05):
  • [26] On-line coloring of sparse random graphs and random trees
    Pittel, B
    Weishaar, RS
    JOURNAL OF ALGORITHMS, 1997, 23 (01) : 195 - 205
  • [27] COLORING RANDOM AND SEMI-RANDOM K-COLORABLE GRAPHS
    BLUM, A
    SPENCER, J
    JOURNAL OF ALGORITHMS, 1995, 19 (02) : 204 - 234
  • [28] Coloring complete bipartite graphs from random lists
    Krivelevich, Michael
    Nachmias, Asaf
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (04) : 436 - 449
  • [29] Coloring graphs from random lists of size 2
    Casselgren, Carl Johan
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (02) : 168 - 181
  • [30] ONLINE VERTEX-COLORING GAMES IN RANDOM GRAPHS
    Marciniszyn, Martin
    Spoehel, Reto
    COMBINATORICA, 2010, 30 (01) : 105 - 123
12345