Skip to main content
SpringerLink
Log in

Packing λ-Fold Complete Multipartite Graphs with 4-Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A maximum packing of any λ-fold complete multipartite graph (where there are λ edges between any two vertices in different parts) with edge-disjoint 4-cycles is obtained and the size of each minimum leave is given. Moreover, when λ=2, maximum 4-cycle packings are found for all possible leaves.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Brisbane, Qld, 4072, Australia

    Elizabeth J. Billington

  2. Department of Applied Mathematics, National Chiao-Tung University, Hsin-Chu, Taiwan, R.O.C

    Hung-Lin Fu

  3. Department of Discrete and Statistical Sciences, Auburn University, 235 Allison Lab, AL, 36849–5307, USA

    C. A. Rodger

Authors
  1. Elizabeth J. Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hung-Lin Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. A. Rodger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elizabeth J. Billington.

Additional information

This research was supported by Australian Research Council Grant A69701550

This research was supported by NSC Grant 88-2115-M-009-013

This research was supported by NSF Grant DMS-9531722 and ONR Grant N00014-97-1-1067

Rights and permissions

Reprints and permissions

About this article

Cite this article

Billington, E.J., Fu, HL. & Rodger, C.A. Packing λ-Fold Complete Multipartite Graphs with 4-Cycles. Graphs and Combinatorics 21, 169–186 (2005). https://doi.org/10.1007/s00373-004-0601-0

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0601-0

Keywords

Search

Navigation