메뉴 건너뛰기




Volumn 236, Issue 1-3, 2001, Pages 131-143

Consecutive colorings of the edges of general graphs

Author keywords

Chromatic index; Consecutive (interval) coloring; Deficiency of graph; Edge coloring; NP completeness

Indexed keywords


EID: 0035815959     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00437-4     Document Type: Article
Times cited : (43)

References (13)
  • 2
    • 0010568493 scopus 로고
    • Investigation on interval edge-colorings of graphs
    • A.S. Asratian, R.R. Kamalian, Investigation on interval edge-colorings of graphs, J. Combin. Theory Ser. B 62 (1994) 34-43.
    • (1994) J. Combin. Theory Ser. B , vol.62 , pp. 34-43
    • Asratian, A.S.1    Kamalian, R.R.2
  • 3
    • 0038873932 scopus 로고    scopus 로고
    • The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard
    • K. Giaro, The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard, Ars Combin. 47 (1997) 287-300.
    • (1997) Ars Combin. , vol.47 , pp. 287-300
    • Giaro, K.1
  • 4
    • 0346025187 scopus 로고    scopus 로고
    • Consecutive edge-colorings of complete and incomplete Cartesian products of graphs
    • K. Giaro, M. Kubale, Consecutive edge-colorings of complete and incomplete Cartesian products of graphs, Congr. Numer. 128 (1997) 143-149.
    • (1997) Congr. Numer. , vol.128 , pp. 143-149
    • Giaro, K.1    Kubale, M.2
  • 5
    • 0346656303 scopus 로고    scopus 로고
    • Compact scheduling in open shop with zero-one time operations
    • 000-000
    • K. Giaro, M. Kubale, M. Małafiejski, Compact scheduling in open shop with zero-one time operations, INFOR 37 (1999) 000-000.
    • (1999) INFOR , vol.37
    • Giaro, K.1    Kubale, M.2    Małafiejski, M.3
  • 7
    • 0032425432 scopus 로고    scopus 로고
    • On interval colorings of bi-regular bipartite graphs
    • D. Hanson, C.O.M. Loten, B. Toft, On interval colorings of bi-regular bipartite graphs, Ars Combin. 50 (1998) 23-32.
    • (1998) Ars Combin. , vol.50 , pp. 23-32
    • Hanson, D.1    Loten, C.O.M.2    Toft, B.3
  • 9
    • 0023289230 scopus 로고
    • The complexity of scheduling independent two-processor tasks on dedicated processors
    • M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors, Inform. Process. Lett. 24 (1987) 141-147.
    • (1987) Inform. Process. Lett. , vol.24 , pp. 141-147
    • Kubale, M.1
  • 10
    • 0003016471 scopus 로고
    • NP-completeness of finding the chromatic index of regular graphs
    • D. Leven, Z. Galil, NP-completeness of finding the chromatic index of regular graphs, J. Algorithms 4 (1983) 35-44.
    • (1983) J. Algorithms , vol.4 , pp. 35-44
    • Leven, D.1    Galil, Z.2
  • 11
    • 0013520618 scopus 로고
    • On interval colorability of a bipartite graph
    • in Russian
    • S.V. Sevastjanov, On interval colorability of a bipartite graph, Met. Diskret. Analiz. 50 (1990) 61-72 (in Russian).
    • (1990) Met. Diskret. Analiz. , vol.50 , pp. 61-72
    • Sevastjanov, S.V.1
  • 12
    • 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, Met. Diskret. Analiz. 3 (1964) 25-30 (in Russian).
    • (1964) Met. Diskret. Analiz. , vol.3 , pp. 25-30
    • Vizing, V.G.1
  • 13
    • 85057633595 scopus 로고    scopus 로고
    • Compact scheduling of zero-one time operations in multi-stage systems
    • submitted
    • K. Giaro, M. Kubale, Compact scheduling of zero-one time operations in multi-stage systems, Discrete Appl. Math. (submitted).
    • Discrete Appl. Math.
    • Giaro, K.1    Kubale, M.2


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