Highly Influenced

# Game chromatic index of k-degenerate graphs

@article{Cai2001GameCI, title={Game chromatic index of k-degenerate graphs}, author={Leizhen Cai and Xuding Zhu}, journal={Journal of Graph Theory}, year={2001}, volume={36}, pages={144-155} }

- Published 2001 in Journal of Graph Theory
DOI:10.1002/1097-0118(200103)36:3%3C144::AID-JGT1002%3E3.0.CO;2-F

We consider the following edge coloring game on a graph G. Given t distinct colors, two players Alice and Bob, with Alice moving ®rst, alternately select an uncolored edge e of G and assign it a color different from the colors of edges adjacent to e. Bob wins if, at any stage of the game, there is an uncolored edge adjacent to colored edges in all t colors; otherwise Alice wins. Note that when Alice wins, all edges of G are properly colored. The game chromatic index of a graph G is the minimum… CONTINUE READING