IMPROVED EDGE-COLORING ALGORITHMS FOR PLANAR GRAPHS

被引：13
|
作者：
CHROBAK, M
NISHIZEKI, T
机构：
[1] UNIV CALIF RIVERSIDE, DEPT MATH & COMP SCI, RIVERSIDE, CA 92521 USA
[2] TOHOKU UNIV, DEPT ELECT COMMUN, SENDAI, MIYAGI 980, JAPAN
来源：
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1990年 / 11卷 / 01期
关键词：
D O I：
10.1016/0196-6774(90)90032-A
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the problem of edge-coloring planar graphs. It is known that a planar graph G with maximum degree Δ ≥ 8 can be colored with Δ colors. We present two algorithms which find such a coloring when Δ ≥ 9. The first one is a sequential O(n log n) time algorithm. The other one is a parallel EREW PRAM algorithm which works in time O(log3n) and uses O(n) processors. © 1990.
引用
收藏
页码：102 / 116
页数：15
相关论文
共 50 条
  • [1] FAST ALGORITHMS FOR EDGE-COLORING PLANAR GRAPHS
    CHROBAK, M
    YUNG, MT
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1989, 10 (01): : 35 - 51
  • [2] Strong edge-coloring of planar graphs
    Hudak, David
    Luzar, Borut
    Sotak, Roman
    Skrekovski, Riste
    [J]. DISCRETE MATHEMATICS, 2014, 324 : 41 - 49
  • [3] STRONG EDGE-COLORING OF PLANAR GRAPHS
    Song, Wen-Yao
    Miao, Lian-Ying
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (04) : 845 - 857
  • [4] ACYCLIC EDGE-COLORING OF PLANAR GRAPHS
    Basavaraju, Manu
    Chandran, L. Sunil
    Cohen, Nathann
    Havet, Frederic
    Mueller, Tobias
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 463 - 478
  • [5] New linear-time algorithms for edge-coloring planar graphs
    Cole, Richard
    Kowalik, Lukasz
    [J]. ALGORITHMICA, 2008, 50 (03) : 351 - 368
  • [6] New Linear-Time Algorithms for Edge-Coloring Planar Graphs
    Richard Cole
    Łukasz Kowalik
    [J]. Algorithmica, 2008, 50 : 351 - 368
  • [7] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Hu, Dai-Qiang
    Wu, Jian-Liang
    Yang, Donglei
    Zhang, Xin
    [J]. GRAPHS AND COMBINATORICS, 2017, 33 (04) : 945 - 953
  • [8] Complexity and algorithms for injective edge-coloring in graphs
    Foucaud, Florent
    Hocquard, Herve
    Lajou, Dimitri
    [J]. INFORMATION PROCESSING LETTERS, 2021, 170
  • [9] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Dai-Qiang Hu
    Jian-Liang Wu
    Donglei Yang
    Xin Zhang
    [J]. Graphs and Combinatorics, 2017, 33 : 945 - 953
  • [10] Strong edge-coloring for planar graphs with large girth
    Chen, Lily
    Deng, Kecai
    Yu, Gexin
    Zhou, Xiangqian
    [J]. DISCRETE MATHEMATICS, 2019, 342 (02) : 339 - 343
12345