The game chromatic index of forests of maximum degree Δ⩾5Δ⩾5

Using a refinement of the methods of Erdös et al. [Note on the game chromatic index of trees, Theoret. Comput. Sci. 313 (2004) 371–376] we prove that the game chromatic index of forests of maximum node degree 5 is at most 6. This improves the previously known upper bound 7 for this parameter. The bound 6 is tight [P. Erdös, U. Faigle, W. Hochstättler, W. Kern, Note on the game chromatic index of trees, Theoret. Comput. Sci. 313 (2004) 371–376].