A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A New Upper Bound on the Game Chromatic Index of Graphs

2018
*
Electronic Journal of Combinatorics
*

We study the two-player game where Maker and Breaker alternately color the edges of a given graph $G$ with $k$ colors such that adjacent edges never get the same color. Maker's goal is to play such that at the end of the game, all edges are colored. Vice-versa, Breaker wins as soon as there is an uncolored edge where every color is blocked. The game chromatic index $\chi'_g(G)$ denotes the smallest $k$ for which Maker has a winning strategy.The trivial bounds $\Delta(G) \le \chi_g'(G) \le

doi:10.37236/7451
fatcat:albm4es7czfgnaf7d366mbp3im