Skip to main content
SpringerLink
Log in

On the Oberwolfach Problem with Two Similar Length Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 For all m≥3, the Oberwolfach problem is solved for the case where the 2-factors consist of two cycles of lengths m and m+1, and for the case where the 2-factors consist of two cycles of lengths m and m+2.

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, Qld 4072, Australia. e-mail: db@maths.uq.edu.au, , , , , , AU

    Darryn E. Bryant

Authors
  1. Darryn E. Bryant
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: September 1, 1997 Final version received: August 10, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bryant, D. On the Oberwolfach Problem with Two Similar Length Cycles. Graphs Comb 17, 199–206 (2001). https://doi.org/10.1007/s003730170033

Download citation

  • Issue Date:

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

Keywords

Search

Navigation