List edge-colorings of series-parallel graphs

被引：0
|
作者：
Fujino, T [1 ]
Zhou, X [1 ]
Nishizeki, T [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2003年 / E86A卷 / 05期
关键词：
algorithm; list edge-coloring; series-parallel graph;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge-coloring if each edge e of G is colored with a color contained in L(e). In this paper, we prove that any series-parallel simple graph G has an L-edge-coloring if \L(e)\ greater than or equal to max {3,d(upsilon),d(omega)} for each edge e = upsilonw, where d(upsilon) and d(omega) are the degrees of the ends upsilon and omega of e, respectively. Our proof yields a linear algorithm for finding an L-edge-coloring of series-parallel graphs.
引用
收藏
页码：1034 / 1045
页数：12
相关论文
共 50 条
  • [21] Normal edge-colorings of cubic graphs
    Mazzuoccolo, Giuseppe
    Mkrtchyan, Vahan
    [J]. JOURNAL OF GRAPH THEORY, 2020, 94 (01) : 75 - 91
  • [22] Interval edge-colorings of complete graphs
    Khachatrian, H. H.
    Petrosyan, P. A.
    [J]. DISCRETE MATHEMATICS, 2016, 339 (09) : 2249 - 2262
  • [23] MINIMAL EDGE-COLORINGS OF COMPLETE GRAPHS
    CAMERON, PJ
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1975, 11 (OCT): : 337 - 346
  • [24] Generalized edge-colorings of weighted graphs
    Obata, Yuji
    Nishizeki, Takao
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (01)
  • [25] Equitable Edge-Colorings of Simple Graphs
    Zhang, Xia
    Liu, Guizhen
    [J]. JOURNAL OF GRAPH THEORY, 2011, 66 (03) : 175 - 197
  • [26] On Interval Edge-Colorings of Bipartite Graphs
    Petrosyan, Petros
    Khachatrian, Hrant
    Mamikonyan, Tigran
    [J]. TENTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGIES REVISED SELECTED PAPERS CSIT-2015, 2015, : 71 - 76
  • [27] Efficient algorithms for weighted colorings of series-parallel graphs
    Zhou, X
    Nishizeki, T
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 514 - 524
  • [28] INVESTIGATION ON INTERVAL EDGE-COLORINGS OF GRAPHS
    ASRATIAN, AS
    KAMALIAN, RR
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) : 34 - 43
  • [29] Efficient algorithms for weighted colorings of series-parallel graphs
    Zhou, Xiao
    Nishizeki, Takao
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001, 2223 LNCS : 514 - 524
  • [30] ACYCLIC EDGE-COLORINGS OF SPARSE GRAPHS
    CARO, Y
    RODITTY, Y
    [J]. APPLIED MATHEMATICS LETTERS, 1994, 7 (01) : 63 - 67
12345