English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58323/91876 (63%)
造访人次 : 14069867      在线人数 : 99
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58741


    题名: Graphs of Large Girth with Prescribed Partial Circular Colourings.
    作者: 潘志實;朱緒鼎
    贡献者: 淡江大學數學學系
    关键词: Circular chromatic number;Girth;Uniquely colourable
    日期: 2005-03-01
    上传时间: 2011-10-01 21:07:28 (UTC+8)
    摘要: This paper completes the constructive proof of the following result: Suppose p/q≥2 is a rational number, A is a finite set and f1,f2,···,fn are mappings from A to {0,1,···,p−1}. Then for any integer g, there is a graph G=(V,E) of girth at least g with https://static-content.springer.com/image/art%3A10.1007%2Fs00373-004-0596-6/MediaObjects/s00373-004-0596-6flb1.gif such that G has exactly n (p,q)-colourings (up to equivalence) g1,g2,···,gn, and each gi is an extension of fi. A probabilistic proof of this result was given in [8]. A constructive proof of the case p/q≥3 was given in [7].
    關聯: Graphs and combinatorics 21, pp.119-129
    DOI: 10.1007/s00373-004-0596-6
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Graphs of Large Girth with Prescribed Partial Circular Colourings.pdf399KbAdobe PDF0检视/开启
    index.html0KbHTML15检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈