A short proof of a conjecture on the \(T_r\)-choice number of even cycles

DOI10.1016/S0166-218X(99)00058-XzbMath0931.05039WikidataQ122887876 ScholiaQ122887876MaRDI QIDQ1304486

R. A. Sitters

Publication date: 23 February 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclechoice numberconjecture of Alon and Zaks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Some new bounds on \(T_{r}\)-choosability ⋮ Circular choosability ⋮ List version of \(L(d,s)\)-labelings

Cites Work

• Unnamed Item
• List \(T\)-colorings of graphs
• Some results on list \(T\)-colourings
• \(T\)-choosability in graphs
• Graph colorings with local constraints -- a survey

This page was built for publication: A short proof of a conjecture on the \(T_r\)-choice number of even cycles