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

IEICE Transactions on Information and Systems

Volumn E86-D, Issue 2, 2003, Pages 186-190

  Fujino, Tomoya ^a   Isobe, Shuji ^a   Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; List edge coloring; Series parallel graph

Indexed keywords

ALGORITHMS; COLOR; GRAPH THEORY;

SERIES-PARALLEL GRAPH;

INFORMATION ANALYSIS;

EID: 0038719249     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (11)

1. O.V. Borodin, A.V. Kostochka, and D.R. Woodall, "List edge and list total colourings of multigraphs," J. Combinatorial Theory, Series B, vol.71, pp.184-204, 1997.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
3. R. Diestel, Graph Theory, Springer-Verlag, New York, 1997.
4. F. Galvin, "The list chromatic index of a bipartite multigraph," J. Combinatorial Theory, Series B, vol.63, pp.153-158, 1995.
5. I. Holyer, "The NP-completeness of edge-coloring," SIAM J. Comput., vol.10, no.4, pp.718-720, 1981.
6. M. Juvan, B. Mohar, and R. Thomas, "List edge-colorings of series-parallel graphs," The Electronic Journal of Combinatorics, vol.6, no.42, pp.1-6, 1999.
7. D. König, "Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre," Math. Annalen, vol.77, pp.453-465, 1916.
8. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
9. O. Terada and T. Nishizeki, "Approximate algorithms for the edge-coloring of graphs," IECE Trans. Inf. & Syst. (Japanese Edition), vol.J65-D, no.11, pp.1382-1389, Nov. 1982.
10. V.G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret Analiz, vol.3, pp.25-30, 1964 (in Russian).
11. J.L. Wu, "List edge-colouring of series-parallel graphs,"Shandong Daxue Xuebao Ziran Kexue Ban, vol.35, no.2, pp. 144-149, 2000 (in Chinese).