메뉴 건너뛰기
Electronic Journal of Combinatorics
Volumn 7, Issue 1 R, 2000, Pages 1-9
Online coloring known graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0010776733     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1485     Document Type: Article
Times cited : (20)
References (7)
  • 2
    • 0029701337 scopus 로고    scopus 로고
    • Lower bounds for on-line graph problems with application to on-line circuit and optical routing
    • Yair Bartal, Amos Fiat, and Stefano Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proc. 28th Ann. ACM Symp. on Theory of Computing, (1996), 531-540.
    • (1996) Proc. 28th Ann. ACM Symp. on Theory of Computing , pp. 531-540
    • Bartal, Y.1    Fiat, A.2    Leonardi, S.3
  • 3
    • 0001246406 scopus 로고
    • Effective coloration
    • Dwight Bean. Effective coloration. J. Symbolic Logic, 41 (1976), 469-480.
    • (1976) J. Symbolic Logic , vol.41 , pp. 469-480
    • Bean, D.1
  • 4
    • 84986456107 scopus 로고
    • On-line and first fit colorings of graphs
    • A. Gyárfás and J. Lehel. On-line and first fit colorings of graphs. J. Graph Theory, 12(2) (1988), 217-227.
    • (1988) J. Graph Theory , vol.12 , Issue.2 , pp. 217-227
    • Gyárfás, A.1    Lehel, J.2
  • 5
    • 0347072536 scopus 로고    scopus 로고
    • Parallel and on-line graph coloring
    • Magnús M. Halldórsson. Parallel and on-line graph coloring. J. Algorithms, 23 (1997), 265-280.
    • (1997) J. Algorithms , vol.23 , pp. 265-280
    • Halldórsson, M.M.1
  • 7
    • 0010777434 scopus 로고    scopus 로고
    • On-line coloring k-colorable graphs
    • Hal Kierstead. On-line coloring k-colorable graphs. Israel J. of Math 105 (1998), 93-104.
    • (1998) Israel J. of Math , vol.105 , pp. 93-104
    • Kierstead, H.1

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