Game chromatic index of graphs with given restrictions on degrees (Q954995)

The paper is oriented on two-person games on graphs, where players alternatively color its edges. The problem to be analyzed regards the minimal number of colors ensuring that all edges will be colored. More precisely, the minimum number of colors for which the first player has a strategy with the above properties is estimated. This number is called the game chromatic index, and the main results of the paper regard the estimation of its lower and upper bounds.