Linear algorithm for finding list edge-colorings of series-parallel graphs

Tomoya Fujino, Shuji Isobe, Xiao Zhou, Takao Nishizeki

研究成果: Article査読

2 被引用数 (Scopus)

抄録

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). It is known that any series-parallel simple graph G has an L-edge-coloring if either (i) |L(e)| ≥ max{4, d(v), d(w)} for each edge e = vw or (ii) the maximum degree of G is at most three and |L(e)| ≥ 3 for each edge e, where d(v) and d(w) are the degrees of the ends v and w of e, respectively. In this paper we give a linear-time algorithm for finding such an L-edge-coloring of a series-parallel graph G.

本文言語English
ページ(範囲)186-190
ページ数5
ジャーナルIEICE Transactions on Information and Systems
E86-D
2
出版ステータスPublished - 2003 2

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

フィンガープリント 「Linear algorithm for finding list edge-colorings of series-parallel graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル