English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51756/86971 (60%)
Visitors : 8356807      Online Users : 84
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/41296


    Title: Decomposition of Km,n into 4-cycles and 2t-cycles
    Authors: Chou, Chao-chih;高金美;Fu, Chin-mei
    Contributors: 淡江大學數學學系
    Keywords: Complete bipartite graph;Cycle decomposition
    Date: 2007-10-01
    Issue Date: 2010-01-28 07:13:31 (UTC+8)
    Publisher: Springer
    Abstract: In this paper we show the sufficient conditions for the decomposition of the complete bipartite graphs K2m,2n and K2n+1,2n+1−F into cycles of two different lengths 4 and 2t, t>2, where F is a 1-factor of K2n+1,2n+1. After that we prove that the results are true for t=5 and 6.
    Relation: Journal of Combinatorial Optimization 14(2), pp.205-218
    DOI: 10.1007/s10878-007-9060-x
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown269View/Open
    index.html0KbHTML51View/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