Greedy coloring and Grundy number

被引：0
|
作者：
Sun, Huiquan
机构：
来源：
Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications | 1999年 / 22卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
(Edited Abstract)
引用
收藏
页码：14 / 19
相关论文
共 50 条
  • [31] More bounds for the Grundy number of graphs
    Tang, Zixing
    Wu, Baoyindureng
    Hu, Lin
    Zaker, Manoucheher
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 580 - 589
  • [32] THE COLORING NUMBER
    KOMJATH, P
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1987, 54 : 1 - 14
  • [33] Bounds for the Grundy chromatic number of graphs in terms of domination number
    Khaleghi, Abbas
    Zaker, Manouchehr
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2022, 29 (02) : 193 - 206
  • [34] A Note on Random Greedy Coloring of Uniform Hypergraphs
    Cherkashin, Danila D.
    Kozik, Jakub
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 407 - 413
  • [35] Multipass Greedy Coloring of Simple Uniform Hypergraphs
    Kozik, Jakub
    RANDOM STRUCTURES & ALGORITHMS, 2016, 48 (01) : 125 - 146
  • [36] THE GREEDY ALGORITHM IS OPTIMAL FOR ONLINE EDGE COLORING
    BARNOY, A
    MOTWANI, R
    NAOR, J
    INFORMATION PROCESSING LETTERS, 1992, 44 (05) : 251 - 253
  • [37] A matched approximation bound for the sum of a greedy coloring
    Bar-Noy, A
    Halldórsson, MM
    Kortsarz, G
    INFORMATION PROCESSING LETTERS, 1999, 71 (3-4) : 135 - 140
  • [38] New potential functions for greedy independence and coloring
    Borowiecki, Piotr
    Rautenbach, Dieter
    DISCRETE APPLIED MATHEMATICS, 2015, 182 : 61 - 72
  • [39] A PASSAGE TIME FOR GREEDY-COLORING CYCLES
    PREATER, J
    RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (01) : 105 - 111
  • [40] Matched approximation bound for the sum of a greedy coloring
    Bar-Noy, Amotz
    Halldórsson, Magnús M.
    Kortsarz, Guy
    Information Processing Letters, 1999, 71 (03): : 135 - 140
12345