IEICE TRANSACTIONS on Information
Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs
Summary :
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)|
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.2 pp.186-190
- Publication Date
- 2003/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
- Category
- Graph Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tomoya FUJINO, Shuji ISOBE, Xiao ZHOU, Takao NISHIZEKI, "Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 2, pp. 186-190, February 2003, doi: .
Abstract: 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)|
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_2_186/_p
Copy
@ARTICLE{e86-d_2_186,
author={Tomoya FUJINO, Shuji ISOBE, Xiao ZHOU, Takao NISHIZEKI, },
journal={IEICE TRANSACTIONS on Information},
title={Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs},
year={2003},
volume={E86-D},
number={2},
pages={186-190},
abstract={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)|
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 186
EP - 190
AU - Tomoya FUJINO
AU - Shuji ISOBE
AU - Xiao ZHOU
AU - Takao NISHIZEKI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2003
AB - 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)|
ER -
English
