### Abstract

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.

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Publication status | Published - 2002 |

### Publication series

Name | Memorandum / Faculty of Mathematical Sciences |
---|---|

Publisher | Department of Applied Mathematics, University of Twente |

No. | 1652 |

ISSN (Print) | 0169-2690 |

### Keywords

- MSC-90D46
- IR-65838
- EWI-3472

## Cite this

Erdös, P. L., Faigle, U., Hochstättler, W., & Kern, W. (2002).

*Note on the game chromatic index of trees*. (Memorandum / Faculty of Mathematical Sciences; No. 1652). Enschede: University of Twente, Department of Applied Mathematics.