We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree $\Delta = 3$ is at most $\Delta + 1$. We show that the same holds true in case $\Delta \geq 6$, which would leave only the cases $\Delta = 4$ and $\Delta = 5$ open.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Publication status||Published - 2002|
|Name||Memorandum / Faculty of Mathematical Sciences|
|Publisher||Department of Applied Mathematics, University of Twente|