메뉴 건너뛰기
Discrete Mathematics
Volumn 262, Issue 1-3, 2003, Pages 89-98
Relaxed game chromatic number of graphs
Author keywords

Game chromatic number; Game coloring number; Outerplanar graph; Relaxed game chromatic number
Indexed keywords

EID: 84867936221     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00521-6     Document Type: Article
Times cited : (34)
References (18)
  • 1
    • 0040203449 scopus 로고
    • 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-148.
    • (1991) Int. J. Found. Comput. Sci. , vol.2 , pp. 133-148
    • Bodlaender, H.L.1
  • 2
    • 0033445480 scopus 로고    scopus 로고
    • Acyclic improper colorings of graphs
    • P. Boiron, E. Sopena, L. Vignal, Acyclic improper colorings of graphs, J. Graph Theory 32 (1999) 97-107.
    • (1999) J. Graph Theory , vol.32 , pp. 97-107
    • Boiron, P.1    Sopena, E.2    Vignal, L.3
  • 3
    • 23044527212 scopus 로고    scopus 로고
    • 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.1    Zhu, X.2
  • 4
    • 84986500394 scopus 로고
    • 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.1    Cowen, R.H.2    Woodall, D.R.3
  • 6
    • 0346234045 scopus 로고    scopus 로고
    • 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.1    Zhu, X.2
  • 7
    • 0038621187 scopus 로고    scopus 로고
    • 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.1    Zhu, X.2
  • 8
    • 0038621183 scopus 로고
    • On the game chromatic number of some classes of graphs
    • U. Faigle, U. 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.1    Kern, U.2    Kierstead, H.A.3    Trotter, W.T.4
  • 9
    • 0012069660 scopus 로고
    • A Survey of (m; K)-colorings
    • M. Frick, A survey of (m; k)-colorings, Ann. Discrete Math. 55 (1993) 45-58.
    • (1993) Ann. Discrete Math. , vol.55 , pp. 45-58
    • Frick, M.1
  • 10
    • 0033477109 scopus 로고    scopus 로고
    • The game chromatic number of outerplanar graphs
    • D. Guan, X. Zhu, The game chromatic number of outerplanar graphs, J. Graph Theory 30 (1999) 67-70.
    • (1999) J. Graph Theory , vol.30 , pp. 67-70
    • Guan, D.1    Zhu, X.2
  • 12
    • 0037944981 scopus 로고    scopus 로고
    • 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.1
  • 13
    • 84987487282 scopus 로고
    • Planar graph coloring with an uncooperative partner
    • H.A. Kierstead, W.T. Trotter, 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.1    Trotter, W.T.2
  • 15
    • 0033467290 scopus 로고    scopus 로고
    • List improper colorings of planar graph
    • R. U Skrekovski, List improper colorings of planar graph, Combin. Probab. Comput. 8 (1999) 293-299.
    • (1999) Combin. Probab. Comput. , vol.8 , pp. 293-299
    • Skrekovski, R.U.1
  • 16
    • 0347632590 scopus 로고    scopus 로고
    • Improper colorings of graphs
    • R. Nelson, R.J. Wilson (Eds.) New York
    • D.R. Woodall, Improper colorings of graphs, in: R. Nelson, R.J. Wilson (Eds.), Graph Colorings, Longman Scientifc and Technical, New York, 1999, pp. 45-63.
    • (1999) Graph Colorings Longman Scientifc and Technical , pp. 45-63
    • Woodall, D.R.1
  • 17
    • 0038621143 scopus 로고    scopus 로고
    • The game coloring number of planar graphs
    • X. Zhu, The 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.1
  • 18
    • 0008808309 scopus 로고    scopus 로고
    • Game coloring number of pseudo partial k-trees
    • X. Zhu, Game coloring number of pseudo partial k-trees, Discrete Math. 215 (2000) 245-262.
    • (2000) Discrete Math , vol.215 , pp. 245-262
    • Zhu, X.1

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