Skip to main content
Log in

Hamilton Decomposable Graphs with Specified Leaves

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

In this paper, a simple proof is given of a result that provides necessary and sufficient conditions for the existence of a hamilton decomposition of GE(H) for any non-bipartite r-regular complete multipartite graph G and for any 2-factor H of G. Such conditions were originally obtained by Buchanan for complete graphs (ie when r=|V(G)|−1), and in some cases by Leach and Rodger otherwise (Leach and Rodger also settled the bipartite case). This result is extended to consider hamilton decompositions of GE(HF), where F is a 1-factor of G.

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

Access this article

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

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rodger, C. Hamilton Decomposable Graphs with Specified Leaves. Graphs and Combinatorics 20, 541–543 (2004). https://doi.org/10.1007/s00373-004-0573-0

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Navigation