### Title page for etd-0627104-190111

URN etd-0627104-190111 Chung-ying Yang m9124611@student.nsysu.edu.tw This thesis had been viewed 5219 times. Download 1947 times. Applied Mathematics 2003 2 Master English List circular coloring of even cycles 2004-06-04 18 even cycle circular coloring Suppose G is a graph and p >= 2q are positive integers. Acolor-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) ofpermissible colors. An L-(p, q)-coloring of G is a (p,q)-coloring h of G such that for each vertex v,h(v) in L(v). We say G is L-(p, q)-colorable ifsuch a coloring exists. A color-size-list is a mapping f: V -->{0, 1, 2,..., p}, which assigns to each vertex v anon-negative integer f(v). We say G is f-(p, q)-colorableif for every color-list L with |{L}(v)| = f(v), G isL-(p, q)-colorable. For odd cycles C, Raspaud and Zhugave a sharp sufficient condition for a color-size-list f underwhich C is f-(2k+1, k)-colorable. The correspondingquestion for even cycles remained open. In this paper, weconsider list circular coloring of even cycles. For each even cycle C of length n and for each positive integer k, wegive a condition on f which is sufficient and sharp for C tobe f-(2k+1, k)-colorable. H. G. Yeh - chair S. C. Liaw - co-chair Sen-Peng Eu - co-chair Xuding Zhu - advisor indicate access worldwide 2004-06-27

Browse | Search All Available ETDs