@book{8dafd80805bc49f49bce697ed8905fdc,
title = "Note on the game chromatic index of trees",
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.",
keywords = "MSC-90D46, IR-65838, EWI-3472",
author = "P.L. Erd{\"o}s and U. Faigle and W. Hochst{\"a}ttler and Walter Kern",
year = "2002",
language = "Undefined",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente",
number = "1652",
address = "Netherlands",
}