SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 90, Issue 1, 2004, Pages 93-106

A simple competitive graph coloring algorithm II

(2) Lundon, Charles a Kierstead, H A b

a Linsfield College (United States)

b ARIZONA STATE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345868511 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1016/S0095-8956(03)00077-7 Document Type: Article

Times cited : (20)

References (20)

1
- 84991568529
- On the complexity of some coloring games
- R.H. Möhring (Ed.), Lecture Notes in Computer Science, Springer, Berlin
- H.L. Bodlaender, On the complexity of some coloring games, in: R.H. Möhring (Ed.), Graph Theoretical concepts in Computer Science, Lecture Notes in Computer Science, Vol. 484, Springer, Berlin, 1991, pp. 30-40.
- (1991) Graph Theoretical Concepts in Computer Science , vol.484 , pp. 30-40
- Bodlaender, H.L.¹

2
- 23044527212
- Game chromatic index of k-degenerate graphs
- L. Cai, X. Zhu, Game chromatic index of k-degenerate graphs, J. Graph Theory 36 (2001) 144-155.
- (2001) J. Graph Theory , vol.36 , pp. 144-155
- Cai, L.¹ Zhu, X.²

3
- 0011658319
- Graphs with linearly bounded Ramsey numbers
- G. Chen, R.H. Schelp, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993) 138-149.
- (1993) J. Combin. Theory Ser. B , vol.57 , pp. 138-149
- Chen, G.¹ Schelp, R.H.²

4
- 84867936221
- Relaxed game chromatic number of graphs
- C. Chou, W. Wang, X. Zhu, Relaxed game chromatic number of graphs, Discrete Math. 262 (2003) 89-98.
- (2003) Discrete Math. , vol.262 , pp. 89-98
- Chou, C.¹ Wang, W.² Zhu, X.³

5
- 84986500394
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- L.J. Cowen, R.H. Cowen, D.R. Woodall, Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency, J. Graph Theory 10 (1986) 187-195.
- (1986) J. Graph. Theory , vol.10 , pp. 187-195
- Cowen, L.J.¹ Cowen, R.H.² Woodall, D.R.³

6
- 0346248845
- Defective coloring revisited
- L. Cowen, W. Goddard, C. Jesurum, Defective coloring revisited, J. Graph Theory 24 (1997) 205-220.
- (1997) J. Graph Theory , vol.24 , pp. 205-220
- Cowen, L.¹ Goddard, W.² Jesurum, C.³

7
- 0346234045
- Relaxed coloring of a graph
- W. Deuber, X. Zhu, Relaxed coloring of a graph, Graphs Combin. 14 (1998) 121-130.
- (1998) Graphs Combin. , vol.14 , pp. 121-130
- Deuber, W.¹ Zhu, X.²

8
- 0038621187
- A bound for the game chromatic number of graphs
- T. Dinski, X Zhu, A bound for the game chromatic number of graphs, Discrete Math. 196 (1999) 109-115.
- (1999) Discrete Math. , vol.196 , pp. 109-115
- Dinski, T.¹ Zhu, X.²

9
- 0347495047
- A simple competitive graph coloring algorithm III
- manuscript
- C. Dunn, H. Kierstead, A simple competitive graph coloring algorithm III, manuscript, 2002.
- (2002)
- Dunn, C.¹ Kierstead, H.²

10
- 0038580842
- Defective list colorings of planar graphs
- N. Eaton, T. Hull, Defective list colorings of planar graphs, Bull. Inst. Combin. Appl. 25 (1999) 79-87.
- (1999) Bull. Inst. Combin. Appl. , vol.25 , pp. 79-87
- Eaton, N.¹ Hull, T.²

11
- 0038621183
- On the game chromatic number of some classes of graphs
- U. Faigle, W. Kern, H.A. Kierstead, W.T. Trotter, On the game chromatic number of some classes of graphs, Ars Combin. 35 (1993) 143-150.
- (1993) Ars Combin. , vol.35 , pp. 143-150
- Faigle, U.¹ Kern, W.² Kierstead, H.A.³ Trotter, W.T.⁴

12
- 0033477109
- Game chromatic number of outerplanar graphs
- D. Guan, X. Zhu, Game chromatic number of outerplanar graphs, J. Graph Theory 30 (1999) 67-70.
- (1999) J. Graph Theory , vol.30 , pp. 67-70
- Guan, D.¹ Zhu, X.²

13
- 0037944981
- A simple competitive graph coloring algorithm
- H.A. Kierstead, A simple competitive graph coloring algorithm, J. Combin. Theory Ser. B 78 (2000) 57-68.
- (2000) J. Combin. Theory Ser. B , vol.78 , pp. 57-68
- Kierstead, H.A.¹

14
- 84987487282
- Planar graph coloring with an uncooperative partner
- H.A. Kierstead, W.T. Trotter, Planar graph coloring with an uncooperative partner, J. Graph Theory 18 (1994) 569-584.
- (1994) J. Graph Theory , vol.18 , pp. 569-584
- Kierstead, H.A.¹ Trotter, W.T.²

15
- 4043083333
- Competitive colorings of oriented graphs
- (electronic)
- H.A. Kierstead, W.T. Trotter, Competitive colorings of oriented graphs, Electron. J. Combin. 8 (12) (2001) 15 (electronic).
- (2001) Electron. J. Combin. , vol.8 , Issue.12 , pp. 15
- Kierstead, H.A.¹ Trotter, W.T.²

16
- 0038576886
- Marking games and the oriented game chromatic number of partial k-trees
- H.A. Kierstead, Zs. Tuza, Marking games and the oriented game chromatic number of partial k-trees, Graphs Combin. 19 (2003) 121-129.
- (2003) Graphs Combin. , vol.19 , pp. 121-129
- Kierstead, H.A.¹ Tuza, Zs.²

17
- 3543033735
- On the oriented game chromatic number
- (electronic)
- J. Nešetřil, E. Sopena, On the oriented game chromatic number, Electron. J. Combin. 8 (14) (2001) 13 (electronic).
- (2001) Electron. J. Combin. , vol.8 , Issue.14 , pp. 13
- Nešetřil, J.¹ Sopena, E.²

18
- 0033467290
- List improper colourings of planar graphs
- R. Škrekovski, List improper colourings of planar graphs, Combin. Probab. Comput. 8 (1999) 293-299.
- (1999) Combin. Probab. Comput. , vol.8 , pp. 293-299
- Škrekovski, R.¹

19
- 0038621143
- Game coloring number of planar graphs
- X. Zhu, Game coloring number of planar graphs, J. Combin. Theory Ser. B 75 (1999) 245-258.
- (1999) J. Combin. Theory Ser. B , vol.75 , pp. 245-258
- Zhu, X.¹

20
- 0008808309
- The game coloring number of pseudo partial k-trees
- X. Zhu, The game coloring number of pseudo partial k-trees, Discrete Math. 215 (2000) 245-262.
- (2000) Discrete Math. , vol.215 , pp. 245-262
- Zhu, X.¹

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