淡江大學機構典藏:Item 987654321/55462
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58615/92280 (64%)
造訪人次 : 560119      線上人數 : 52
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55462


    題名: Construction of K_n-minor free graphs with given circular chromatic number
    作者: 潘志實;Pan, Zhi-shi;朱緒鼎;Zhu, Xu-ding;廖勝強;Liaw, Sheng-chyang
    貢獻者: 淡江大學數學學系
    關鍵詞: Circular chromatic number;Kn-minor free graphs;Series–parallel construction;Planar graphs;Hadwiger conjecture
    日期: 2003-02
    上傳時間: 2011-08-22 16:06:16 (UTC+8)
    出版者: Amsterdam: Elsevier BV * North-Holland
    摘要: 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.
    關聯: Discrete Mathematics 263(1-3), pp.191-205
    DOI: 10.1016/S0012-365X(02)00529-0
    顯示於類別:[數學學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    03 construction for kn_minor free graph.pdf174KbAdobe PDF614檢視/開啟
    Construction of K_n-minor free graphs with given circular chromatic number.pdf174KbAdobe PDF0檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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