Abstract
We completely solve the problem of the existence of T-factorizations in the class of trees of order 14 with the largest vertex order 6.
Similar content being viewed by others
REFERENCES
L. W. Beineke, “Decomposition of complete graphs into forests,” Magy. Tud. Akad. Kut. Intéz. Közl., 9, 589–594 (1964).
C. Huang and A. Rosa, “Decomposition of complete graphs into trees,” Ars Combinat., 5, 23–63 (1978).
A. J. Petrenjuk, “Enumeration of minimal tree decompositions of complete graphs,” J. Combin. Math. Combin. Computing, 12, 197–199 (1992).
L. P. Petrenyuk, List of Decompositions of Complete Graphs into Isomorphic Components [in Ukrainian], Candidate-Degree Thesis (Physics and Mathematics), Kirovograd (1996).
A. J. Petrenjuk, “On tree factorization of K10,” J. Combin. Math. Combin. Comput., 41, 193–202 (2002).
A. J. Petrenjuk, Every Tree from T [14, 4] Admits a T-Factorization, Deposited in Ukrainian DNTB, No. 147-Uk 2001, Kirovograd (2001).
A. Ya. Petrenyuk, “On the existence of bicyclic T-factorizations of order 14,” in: R. N. Makarov (editor), Proceedings of the Academy [in Russian], Ukrainian State Aviation Academy, Kirovograd, Issue 4, Part 1 (1999), pp. 206–212.
A. Ya. Petrenyuk, “Tree factorizations of complete graphs: the existence, construction, and enumeration,” in: Proceedings of the 7 th International Seminar “Discrete Mathematics and Its Applications” (January - February 2001) [in Russian], Center of Applied Investigations at the Mechanical and Mathematical Department of the Moscow University, Moscow, Part 1 (2001), pp. 26–30.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Petrenyuk, A.Y. On Bicyclic T-Factorizability in the Class T[14, 6]. Ukrainian Mathematical Journal 55, 1207–1217 (2003). https://doi.org/10.1023/B:UKMA.0000010617.44846.98
Issue Date:
DOI: https://doi.org/10.1023/B:UKMA.0000010617.44846.98