Skip to main content
SpringerLink
Log in

Factorizations of product graphs into cycles of uniform length

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The following question is raised by Alspach, Bermond and Sotteau: IfG 1 has a decomposition into hamilton cycles and a 1-factor, andG 2 has a hamilton cycle decmposition (HCD), does their wreath productG 1 *G 2 admit a hamilton cycle decomposition? In this paper the above question is answered with an additional condition onG 1. Further it is shown that some product graphs can be decomposed into cycles of uniform length, that is, the edge sets of the graphs can be partitioned into cycles of lengthk, for some suitablek.

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

References

  1. Alspach, B., Bermond, J.C., Sotteau, D.; Decomposition into cycles I: Hamilton decompositions, in: Cycles and Rays (eds. G. Hahn et. al.), Kluwer Academic Publishers 1990, 9–18

  2. Alspach, B., Schellenberg, P.J., Stinson, D.R., Wagner, D.; The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory Ser. A52, 20–43 (1989)

    Google Scholar 

  3. Auerbach, B., Laskar, R.; On decomposition ofr-partite graphs into edge-disjoint Hamilton circuits. Discrete Math.14, 265–268 (1976)

    Google Scholar 

  4. Baranyai, Z., Szasz, Gy.R.; Hamiltonian decomposition of lexicographic product. J. Comb. Theory Ser. B31, 253–261 (1981)

    Google Scholar 

  5. Bermond, J.C.; Decomposition ofK *n intok-circuits and BalancedG-designs, in: Recent advances in graph theory (ed. M. Fiedler), Proc. Symp. Prague, 1975, 57–68

  6. Bermond, J.C.; Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math.3, 21–28 (1978)

    Google Scholar 

  7. Cockayne, E.J., Hartnell, B.L.; Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory Ser. B23, 174–183 (1977)

    Google Scholar 

  8. Hetyei, G.; On Hamilton circuits and 1-factors of the regular completen-partite graphs, Acta Acad. Pedagog., Civitate Press Ser. 6,19, 5–10 (1975)

    Google Scholar 

  9. Hilton, A.J.W., Rodger, C.A.; Hamiltonian decompositions of complete regularn-partite graphs. Discrete Math.58, 63–78 (1986)

    Google Scholar 

  10. Horton, J.D., Roy, B.K., Schellenberg, P.J., Stinson, D.R.; On decomposing graphs into isomorphic uniform 2-factors. Ann. Discrete Math.27, 297–320 (1985)

    Google Scholar 

  11. Laskar, R.; Decomposition of some composite graphs into hamiltonian cycles. Proc. 5th Hungarian Coll. Keszthely 1976, North Holland, 1978, 705–716

  12. Stong, R.; Hamilton decompositions of cartesian products of graphs. Discrete Math.90, 169–190 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Annamalai University, Annamalainagar 608002, Tamilnadu, India

    A. Muthusamy & P. Paulraja

Authors
  1. A. Muthusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Paulraja
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Muthusamy, A., Paulraja, P. Factorizations of product graphs into cycles of uniform length. Graphs and Combinatorics 11, 69–90 (1995). https://doi.org/10.1007/BF01787423

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation