SCOPUS 정보 검색 플랫폼

Volumn 92, Issue 1, 2004, Pages 137-150

A simple competitive graph coloring algorithm III

Author keywords

Planar graph; Pseudo partial k tree; Relaxed game chromatic number

Indexed keywords

EID: 4344682453 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1016/j.jctb.2004.03.010 Document Type: Article

Times cited : (21)

References (15)

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

3
- 84986500394
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Cowen L.J. Cowen R.H. Woodall D.R. 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.³

4
- 0038621187
- A bound for the game chromatic number of graphs
- Dinski T. Zhu X. 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.²

5
- 0345868511
- A simple competitive graph coloring algorithm II
- Dunn C. Kierstead H.A. A simple competitive graph coloring algorithm II J. Combin. Theory Ser. B 90 2004 93-106
- (2004) J. Combin. Theory Ser. B , vol.90 , pp. 93-106
- Dunn, C.¹ Kierstead, H.A.²

6
- 2342459065
- The relaxed game chromatic number of outer planar graphs
- Dunn C. Kierstead H.A. The relaxed game chromatic number of outer planar graphs J. Graph Theory 46 2004 69-78
- (2004) J. Graph Theory , vol.46 , pp. 69-78
- Dunn, C.¹ Kierstead, H.A.²

7
- 0038621183
- On the game chromatic number of some classes of graphs
- Faigle U. Kern W. Kierstead H.A. Trotter W.T. 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.⁴

8
- 0033477109
- Game chromatic number of outerplanar graphs
- Guan D. Zhu X. 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.²

9
- 0036904469
- Edge-partitions of planar graphs and their game coloring numbers
- He W. Hou X. Lih K. Shao J. Wang W. Zhu X. Edge-partitions of planar graphs and their game coloring numbers J. Graph Theory 41 2002 307-317
- (2002) J. Graph Theory , vol.41 , pp. 307-317
- He, W.¹ Hou, X.² Lih, K.³ Shao, J.⁴ Wang, W.⁵ Zhu, X.⁶

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

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

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

15
- 0008808309
- The game coloring number of pseudo partial k-trees
- Zhu X. 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가 분석하여 추출한 것입니다.