Semirotational Tree Factorizations of Complete Graphs
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.Downloads
Published
25.05.2001
Issue
Section
Research articles
How to Cite
Petrenyuk, A. Ya. “Semirotational Tree Factorizations of Complete Graphs”. Ukrains’kyi Matematychnyi Zhurnal, vol. 53, no. 5, May 2001, pp. 715-21, https://umj.imath.kiev.ua/index.php/umj/article/view/4295.