淡江大學機構典藏:Item 987654321/41219
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3929869      Online Users : 834
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41219


    Title: Decomposition of Km,n into short cycles
    Authors: 周兆智;Chou, Chao-chih;高金美;Fu, Chin-mei;黃文中;Huang, Wen-chung
    Contributors: 淡江大學數學學系
    Keywords: Complete bipartite graph;Cycle;Decomposition
    Date: 1999-02-28
    Issue Date: 2010-01-28 06:59:33 (UTC+8)
    Publisher: Elsevier
    Abstract: Let Km,n be the complete bipartite graph and Cr be an elementary cycle of length r. In this paper, it is shown that G can be decomposed into p copies of C4, q copies of C6 and r copies of C8 for each triple p,q,r of nonnegative integers such that 4p + 6q + 8r = |E(G)|, in the following two cases:
    1.
    (a) G = Km,n, if m ⩾ 4, n ⩾ 6, and m, n are even
    2.
    (b) G = Km,n minus a 1-factor, if n is odd.
    Relation: Discrete Mathematics 197-198, pp.195-203
    DOI: 10.1016/S0012-365X(99)90063-8
    Appears in Collections:[Graduate Institute & Department of Mathematics] Journal Article

    Files in This Item:

    File Description SizeFormat
    0KbUnknown332View/Open
    Decomposition of Km,n into short cycles.pdf363KbAdobe PDF1View/Open
    index.html0KbHTML171View/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