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 条
  • [31] The strong edge-coloring for graphs with small edge weight
    Chen, Lily
    Huang, Mingfang
    Yu, Gexin
    Zhou, Xiangqian
    [J]. DISCRETE MATHEMATICS, 2020, 343 (04)
  • [32] From edge-coloring to strong edge-coloring
    Borozan, Valentin
    Chang, Gerard Jennhwa
    Cohen, Nathann
    Fujita, Shinya
    Narayanan, Narayanan
    Naserasr, Reza
    Valicov, Petru
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (02):
  • [33] Improved edge-coloring with three colors
    Kowalik, Lukasz
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 90 - 101
  • [34] On-line edge-coloring algorithms for degree-bounded bipartite graphs
    Taki, Masakuni
    Sugiura, Mikihito
    Kashiwabara, Toshinobu
    [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2002, E85-A (05) : 1062 - 1065
  • [35] Improved edge-coloring with three colors
    Kowalik, Lukasz
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3733 - 3742
  • [36] Edge-coloring critical graphs with high degree
    Miao, LY
    Wu, JL
    [J]. DISCRETE MATHEMATICS, 2002, 257 (01) : 169 - 172
  • [37] List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
    Bruhn, Henning
    Lang, Richard
    Stein, Maya
    [J]. JOURNAL OF GRAPH THEORY, 2016, 81 (03) : 272 - 282
  • [38] On the vertex distinguishing equitable edge-coloring of graphs
    Zhang, Zhong-fu
    Li, Mu-chun
    Yao, Bing
    Xu, Bo-gen
    Wang, Zhi-wen
    Li, Jing-wen
    [J]. ARS COMBINATORIA, 2008, 86 : 193 - 200
  • [39] Edge-Coloring Vertex-Weighting of Graphs
    Shiu, Wai-Chee
    Lau, Gee-Choon
    Ng, Ho-Kuen
    [J]. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2021, 16 (01): : 1 - 13
  • [40] Strong edge-coloring for cubic Hahn graphs
    Chang, Gerard Jennhwa
    Liu, Daphne Der-Fen
    [J]. DISCRETE MATHEMATICS, 2012, 312 (08) : 1468 - 1475
12345