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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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 PDF635检视/开启
    Construction of K_n-minor free graphs with given circular chromatic number.pdf174KbAdobe PDF1检视/开启

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

    TAIR相关文章

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