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}
}
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

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Game chromatic index of a forest with maximum degree

  • W. He, X. Hou, J. Shao, L. Wang
  • 1999
1 Excerpt

On the game chromatic number of some classes of graphs

  • U. Faigle, U. Kern, H. Kierstead, W. T. Trotter
  • Ars Combin
  • 1993

Similar Papers

Loading similar papers…