Note on the game chromatic index of trees

P.L. Erdos, Péter L. Erdös, U. Faigle, Winfried Hochstättler, Walter Kern

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)


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 Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.
Original languageUndefined
Pages (from-to)371-376
Number of pages6
JournalTheoretical computer science
Issue number3
Publication statusPublished - 2004


  • METIS-219319
  • Game Theory
  • Chromatic index
  • IR-76200

Cite this