| Construction of K_n-minor free graphs with given circular chromatic number | |
|---|---|
| 學年 | 91 |
| 學期 | 2 |
| 出版（發表）日期 | 2003-02-01 |
| 作品名稱 | Construction of K_n-minor free graphs with given circular chromatic number |
| 作品名稱（其他語言） | |
| 著者 | 潘志實; Pan, Zhi-shi; 朱緒鼎; Zhu, Xu-ding; 廖勝強; Liaw, Sheng-chyang |
| 單位 | 淡江大學數學學系 |
| 出版者 | Amsterdam: Elsevier BV * North-Holland |
| 著錄名稱、卷期、頁數 | Discrete Mathematics 263(1-3), pp.191-205 |
| 摘要 | For each integer n⩾5 and each rational number r in the interval [2,n−1], we construct a Kn-minor free graph G with χc(G)=r. This answers a question asked by Zhu (Discrete Mathematics, 229 (1–3) (2001) 371). In case n=5, the constructed graphs are actually planar. Such planar graphs were first constructed in J. Graph Theory 24 (1997) 33 (for ∈[2,3]) and in J. Combin. Theory 76 (1999) 170 (for r∈[3,4]). However, our construction and proof are much simpler. |
| 關鍵字 | Circular chromatic number;Kn-minor free graphs;Series–parallel construction;Planar graphs; Hadwiger conjecture |
| 語言 | en_US |
| ISSN | 0012-365X 1872-681X |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | |
| 國別 | NLD |
| 公開徵稿 | |
| 出版型式 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55462 ) |
GoogleAnalytics