Title page for etd-0627104-190111


[Back to Results | New Search]

URN etd-0627104-190111
Author Chung-ying Yang
Author's Email Address m9124611@student.nsysu.edu.tw
Statistics This thesis had been viewed 5065 times. Download 1889 times.
Department Applied Mathematics
Year 2003
Semester 2
Degree Master
Type of Document
Language English
Title List circular coloring of even cycles
Date of Defense 2004-06-04
Page Count 18
Keyword
  • even cycle
  • circular coloring
  • Abstract Suppose G is a graph and p >= 2q are positive integers. A
    color-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) of
    permissible 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 if
    such a coloring exists. A color-size-list is a mapping f: V -->{0, 1, 2,..., p}, which assigns to each vertex v a
    non-negative integer f(v). We say G is f-(p, q)-colorable
    if for every color-list L with |{L}(v)| = f(v), G is
    L-(p, q)-colorable. For odd cycles C, Raspaud and Zhu
    gave a sharp sufficient condition for a color-size-list f under
    which C is f-(2k+1, k)-colorable. The corresponding
    question for even cycles remained open. In this paper, we
    consider list circular coloring of even cycles. For each even cycle C of length n and for each positive integer k, we
    give a condition on f which is sufficient and sharp for C to
    be f-(2k+1, k)-colorable.
    Advisory Committee
  • H. G. Yeh - chair
  • S. C. Liaw - co-chair
  • Sen-Peng Eu - co-chair
  • Xuding Zhu - advisor
  • Files
  • etd-0627104-190111.pdf
  • indicate access worldwide
    Date of Submission 2004-06-27

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys