IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v14y2007i2d10.1007_s10878-007-9049-5.html
   My bibliography  Save this article

Packing 5-cycles into balanced complete m-partite graphs for odd m

Author

Listed:
  • Ming-Hway Huang

    (Yuanpei Institute of Science and Technology)

  • Chin-Mei Fu

    (Tamkang University)

  • Hung-Lin Fu

    (National Chiao Tung University)

Abstract

Let $K_{n_{1},n_{2},\ldots,n_{m}}$ be a complete m-partite graph with partite sets of sizes n 1,n 2,…,n m . A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by K m(n). In this paper, we completely solve the problem of finding a maximum packing of the balanced complete m-partite graph K m(n), m odd, with edge-disjoint 5-cycles and we explicitly give the minimum leaves.

Suggested Citation

  • Ming-Hway Huang & Chin-Mei Fu & Hung-Lin Fu, 2007. "Packing 5-cycles into balanced complete m-partite graphs for odd m," Journal of Combinatorial Optimization, Springer, vol. 14(2), pages 323-329, October.
    • Handle: RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9049-5
    DOI: 10.1007/s10878-007-9049-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9049-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-007-9049-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9049-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.