Graphs of Large Girth with Prescribed Partial Circular Colourings.
學年 93
學期 2
出版（發表）日期 2005-03-01
作品名稱 Graphs of Large Girth with Prescribed Partial Circular Colourings.
作品名稱（其他語言）
著者 潘志實
單位 淡江大學數學學系
出版者
著錄名稱、卷期、頁數 Graphs and combinatorics 21,　p.119-129
摘要 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].
關鍵字 Circular chromatic number;Girth;Uniquely colourable
語言 en
ISSN 1435-5914
期刊性質 國內
收錄於
產學合作
通訊作者
審稿制度 否
國別 TWN
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58741 )

機構典藏連結