Skip to main content
SpringerLink
Log in

Decompositions of Complete Multipartite Graphs into Cycles of Even Length

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain “small” decompositions exist, are also given for arbitrary even cycle lengths.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centre for Combinatorics, Department of Mathematics, The University of Queensland, Brisbane 4072, Australia. e-mail: ejb@maths.uq.edu.au, , , , , , AU

    Nicholas J. Cavenagh & Elizabeth J. Billington

Authors
  1. Nicholas J. Cavenagh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elizabeth J. Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: November 28, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cavenagh, N., Billington, E. Decompositions of Complete Multipartite Graphs into Cycles of Even Length. Graphs Comb 16, 49–65 (2000). https://doi.org/10.1007/s003730050003

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050003

Keywords

Search

Navigation