论文信息 - Edge game coloring of graphs

Edge game coloring of graphs

Corresponding to the game chromatic number of graphs, we consider in this paper the game chromatic index χg of graphs, which is defined similarly, except that edges, instead of vertices of graphs are colored. Upper bounds for trees and wheels are given.

P. Lam | W. Shiu | B. Xu

[1] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[2] U. Faigle,et al. On the game chromatic number of some classes of graphs , 1991 .

[3] Hans L. Bodlaender. On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..

[4] Hal A. Kierstead,et al. Planar Graph Coloring with an Uncooperative Partner , 1994, Planar Graphs.

[5] deXuding Zhu. Game Chromatic Number of Graphs , 1998 .