메뉴 건너뛰기




Volumn E86-A, Issue 5, 2003, Pages 1034-1045

List Edge-Colorings of Series-Parallel Graphs

Author keywords

Algorithm; List edge coloring; Series parallel graph

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

EID: 0141937828     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (5)

References (11)
  • 2
    • 0003677229 scopus 로고    scopus 로고
    • Springer-verlag, New York
    • R. Diestel, Graph Theory, Springer-verlag, New York, 1997.
    • (1997) Graph Theory
    • Diestel, R.1
  • 3
    • 0038719249 scopus 로고    scopus 로고
    • Linear algorithm for finding list edge-colorings of series-parallel graphs
    • Feb.
    • T. Fujino, S. Isobe, X. Zhou, and T. Nishizeki, "Linear algorithm for finding list edge-colorings of series-parallel graphs," IEICE Trans. Inf. & Syst., vol.E86-D, no.2, pp.186-190, Feb. 2003.
    • (2003) IEICE Trans. Inf. & Syst. , vol.E86-D , Issue.2 , pp. 186-190
    • Fujino, T.1    Isobe, S.2    Zhou, X.3    Nishizeki, T.4
  • 4
    • 0001223187 scopus 로고
    • The list chromatic index of a bipartite multigraph
    • F. Galvin, "The list chromatic index of a bipartite multigraph," J. Combinatorial Theory, Series B, vol.63, pp.153-158, 1995.
    • (1995) J. Combinatorial Theory, Series B , vol.63 , pp. 153-158
    • Galvin, F.1
  • 5
    • 0000429528 scopus 로고
    • The NP-completeness of edge-coloring
    • I. Holyer, "The NP-completeness of edge-coloring," SIAM J. Comput., vol.10, no.4, pp.718-720, 1981.
    • (1981) SIAM J. Comput. , vol.10 , Issue.4 , pp. 718-720
    • Holyer, I.1
  • 7
    • 34250966677 scopus 로고
    • Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre
    • D. König, "Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre," Math. Annalen, vol.77, pp.453-465, 1916.
    • (1916) Math. Annalen , vol.77 , pp. 453-465
    • König, D.1
  • 9
    • 0346273573 scopus 로고
    • Approximate algorithms for the edge-coloring of graphs
    • Nov.
    • 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.
    • (1982) IECE Trans. Inf. & Syst. (Japanese Edition) , vol.J65-D , Issue.11 , pp. 1382-1389
    • Terada, O.1    Nishizeki, T.2
  • 10
    • 0002935868 scopus 로고
    • On an estimate of the chromatic class of a p-graph
    • in Russian
    • V.G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret Analiz, 3, pp.25-30, 1964 (in Russian).
    • (1964) Diskret Analiz , vol.3 , pp. 25-30
    • Vizing, V.G.1
  • 11
    • 0037567785 scopus 로고    scopus 로고
    • List edge-colouring of series-parallel graphs
    • in Chinese
    • 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).
    • (2000) Shandong Daxue Xuebao Ziran Kexue Ban , vol.35 , Issue.2 , pp. 144-149
    • Wu, J.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.