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 条
  • [31] Coloring sparse random graphs in polynomial average time
    Subramanian, C.R.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1879 : 415 - 426
  • [32] Circular coloring of random graphs: statistical physics investigation
    Schmidt, Christian
    Guenther, Nils-Eric
    Zdeborova, Lenka
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
  • [33] Scaling laws for maximum coloring of random geometric graphs
    Borst, Sem
    Bradonjic, Milan
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 427 - 437
  • [34] Coloring graphs from random lists of fixed size
    Casselgren, Carl Johan
    RANDOM STRUCTURES & ALGORITHMS, 2014, 44 (03) : 317 - 327
  • [35] Polynomial iterative algorithms for coloring and analyzing random graphs
    Braunstein, A
    Mulet, R
    Pagnani, A
    Weigt, M
    Zecchina, R
    PHYSICAL REVIEW E, 2003, 68 (03)
  • [36] PROBABILISTIC BEHAVIOR OF A NAIEVE COLORING ALGORITHM ON RANDOM GRAPHS
    KARP, R
    MATULA, DW
    OPERATIONS RESEARCH, 1975, 23 : B264 - B264
  • [37] Online vertex-coloring games in random graphs
    Martin Marciniszyn
    Reto Spöhel
    Combinatorica, 2010, 30 : 105 - 123
  • [38] The threshold for the full perfect matching color profile in a random coloring of random graphs
    Chakraborti, Debsoumya
    Hasabnis, Mihir
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (01): : 1 - 6
  • [39] Coloring Graphs in Oriented Coloring of Cubic Graphs
    Dybizbanski, Janusz
    GRAPHS AND COMBINATORICS, 2022, 38 (05)
  • [40] Coloring Graphs in Oriented Coloring of Cubic Graphs
    Janusz Dybizbański
    Graphs and Combinatorics, 2022, 38
12345