English  |  正體中文  |  简体中文  |  Items with full text/Total items : 58323/91877 (63%)
Visitors : 14305156      Online Users : 103
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/55462

    Title: Construction of K_n-minor free graphs with given circular chromatic number
    Authors: 潘志實;Pan, Zhi-shi;朱緒鼎;Zhu, Xu-ding;廖勝強;Liaw, Sheng-chyang
    Contributors: 淡江大學數學學系
    Keywords: Circular chromatic number;Kn-minor free graphs;Series–parallel construction;Planar graphs;Hadwiger conjecture
    Date: 2003-02
    Issue Date: 2011-08-22 16:06:16 (UTC+8)
    Publisher: Amsterdam: Elsevier BV * North-Holland
    Abstract: 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.
    Relation: Discrete Mathematics 263(1-3), pp.191-205
    DOI: 10.1016/S0012-365X(02)00529-0
    Appears in Collections:[Graduate Institute & Department of Mathematics] Journal Article

    Files in This Item:

    File Description SizeFormat
    03 construction for kn_minor free graph.pdf174KbAdobe PDF609View/Open
    Construction of K_n-minor free graphs with given circular chromatic number.pdf174KbAdobe PDF0View/Open

    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