Some results on list T-colourings

Journal article published in 1997 by Adrian O. Waller

Full text: Download

Publisher: Elsevier

Preprint: archiving allowed. Upload

Postprint: archiving allowed. Upload

Published version: archiving forbidden. Upload

Policy details (opens in a new window). Data provided by SHERPA/RoMEO
In this paper we will give some results on list T-colorings. In particular we will give a lower bound for the T-choice number of even cycles with the set T = {0, 1, 2, …, r}, r ⩾ 1, and give the value of the T-choice number for the even cycles C4, and C2n where n ⩾ r.