@book{9d4bdb4cba6f4e3895362a7dc649bdcd,
title = "A short proof of a conjecture on the Tr-choice number of even cycles",
abstract = "In this note we prove that the $T_r$-choice number of the cycle $C_{2n}$ is equal to the $T_r$-choice number of the path (tree) on $4n-1$ vertices, i.e. $T_r$-$ch(C_{2n}) = \left\lfloor(2r+2)(4n-2)/(4n-1)\right\rfloor + 1$. This solves a recent conjecture of Alon and Zaks.",
keywords = "MSC-05C15, Graph colouring, Tr-choice number, even cycle, METIS-141277, choosability, EWI-3297, list colouring, IR-65666, choice number",
author = "R.A. Sitters",
note = "Memorandum Faculteit TW, nr 1477 ",
year = "1998",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente",
number = "1477",
address = "Netherlands",
}