Published in

Elsevier, Discrete Mathematics, 1-3(174), p. 357-363, 1997

DOI: 10.1016/s0012-365x(96)00349-4

Links

Tools

Export citation

Search in Google Scholar

Some results on list T-colourings

Journal article published in 1997 by Adrian O. Waller
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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.