SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 36, Issue 3, 2001, Pages 144-155

Game chromatic index of k-degenerate graphs

(2) Cai, Leizhen a Zhu, Xuding b

a CHINESE UNIVERSITY OF HONG KONG (Hong Kong)

b NATIONAL SUN YAT SEN UNIVERSITY (Taiwan)

Author keywords

Forest; Game chromatic index; Game chromatic number; K degenerate graph

Indexed keywords

EID: 23044527212 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/1097-0118(200103)36:3<144::aid-jgt1002>3.0.co;2-f Document Type: Article

Times cited : (57)

References (9)

1
- 0040203449
- On the complexity of some coloring games
- H. L. Bodlaender, On the complexity of some coloring games, Int J Found Comput Sci 2 (1991) 133-147.
- (1991) Int J Found Comput Sci , vol.2 , pp. 133-147
- Bodlaender, H.L.¹

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

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

4
- 0033477109
- Game Chromatic Number of Outerplanar Graphs
- D. Guan and 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.²

5
- 25444490422
- manuscript
- W. He, X. Hou, J. Shao, and L. Wang, Game chromatic index of a forest with maximum degree 3, 1999, manuscript.
- (1999) Game Chromatic Index of A Forest with Maximum Degree , vol.3
- He, W.¹ Hou, X.² Shao, J.³ Wang, L.⁴

6
- 0037944981
- A simple competitive graph coloring algorithm
- H. A. Kierstead, 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.¹

7
- 84987487282
- Planar graph coloring with an uncooperative partner
- H. A. Kierstead and 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.²

8
- 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.¹

9
- 0038621143
- The game coloring number of planar graphs
- X. Zhu, The game coloring number of planar graphs, J Combin Theory (B) 75(2) (1999), 245-258.
- (1999) J Combin Theory (B) , vol.75 , Issue.2 , pp. 245-258
- Zhu, X.¹

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