English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8719264      Online Users : 174
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58741

    Title: Graphs of Large Girth with Prescribed Partial Circular Colourings.
    Authors: 潘志實;朱緒鼎
    Contributors: 淡江大學數學學系
    Keywords: Circular chromatic number;Girth;Uniquely colourable
    Date: 2005-03-01
    Issue Date: 2011-10-01 21:07:28 (UTC+8)
    Abstract: 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].
    Relation: Graphs and combinatorics 21, pp.119-129
    DOI: 10.1007/s00373-004-0596-6
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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