English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8704090      Online Users : 167
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/41297

    Title: Packing 5-cycles into balanced complete m-partite graphs for odd m
    Authors: Huang, Ming-hway;高金美;Fu, Chin-mei;Fu, Hung-lin
    Contributors: 淡江大學數學學系
    Keywords: Complete m-partite graph;Balanced complete m-partite graph;5-cycle;Packing;LeaveDecomposition
    Date: 2007-10-01
    Issue Date: 2010-01-28 07:13:40 (UTC+8)
    Publisher: Springer
    Abstract: Let Kn1,n2,…,nmKn1,n2,…,nm be a complete m-partite graph with partite sets of sizes n1,n2,…,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by Km(n). In this paper, we completely solve the problem of finding a maximum packing of the balanced complete m-partite graph Km(n), m odd, with edge-disjoint 5-cycles and we explicitly give the minimum leaves.
    Relation: Journal of Combinatorial Optimization 14(2), pp.323-329
    DOI: 10.1007/s10878-007-9049-5
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    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