Skip to main content
SpringerLink
Log in

Semirotational Tree Factorizations of Complete Graphs

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We select the class of so-called semisymmetric trees and prove that every tree T from this class admits a T-factorization of a special form in the case where T is of order n = 2k ≤ 16. We formulate the conjecture that every semisymmetric tree T admits a T-factorization. We establish the existence of a T-factorization for semisymmetric trees of certain classes.

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. L. W. Beineke, “Decomposition of complete graphs into forests,” Magy. Tud. Akad. Mat. Kut. Intëz. Közl. 9, 589-594 (1964).

    Google Scholar 

  2. C. Huang and A. Rosa, “Decomposition of complete graphs into trees,” Ars Combinat. 5, 23-63 (1978).

    Google Scholar 

  3. F. Harary, Graph Theory Addison-Wesley, Reading, MA (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ukrainian State Aviation Academy, Kirovograd

    A. Ya. Petrenyuk

Authors
  1. A. Ya. Petrenyuk
    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

Petrenyuk, A.Y. Semirotational Tree Factorizations of Complete Graphs. Ukrainian Mathematical Journal 53, 832–839 (2001). https://doi.org/10.1023/A:1012546820764

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012546820764

Keywords

Search

Navigation