Abstract
We investigate the Beineke problem of the existence of T-factorizations of complete graphs and prove several theorems on the existence of T-factorizations. Using these theorems, we establish the nonexistence of T-factorizations for 32 nonisomorphic admissible trees of order 12.
Similar content being viewed by others
References
L. W. Beineke, “Decomposition of complete graphs into forests,” Magy. Tud. Akad. Mat. Kut. Int. Közl., No. 9, 589–594 (1964).
C. Huang and A. Rosa, “Decomposition of complete graphs into trees,” Ars Combinatoria, No. 8, 23–63 (1978).
A. J. Petrenjuk, “On tree factorizations of K 10,” J. Combin. Math. Combin. Comput., 41, 193–202 (2002).
A. Ya. Petrenyuk, “Tree factorizations of complete graphs: existence, construction, and enumeration,” in: The 7th Mathematical International Seminar “Discrete Mathematics and Its Applications” [in Russian], Moscow (2001), pp. 26–30.
A. Ya. Petrenyuk, “Semirotational tree factorizations of complete graphs,” Ukr. Mat. Zh., 55, No. 5, 715–720 (2001).
A. Ya. Petrenyuk, “Necessary conditions for the existence of T-factorizations,” Dopov. Nats. Akad. Nauk Ukr., No. 3, 71–73 (2002).
A. Ya. Petrenyuk, Extremal Decompositions of Complete Graphs: Existence and Enumeration [in Ukrainian], Doctoral-Degree Thesis (Physics and Mathematics), Kyiv (2002).
A. J. Petrenjuk, “Nonisomorphic double star factorizations of order 12,” in: R. M. Makarov (editor), Scientific Works of Academy, Issue 4, Part 1, Ukrainian State Aviation Academy, Kirovohrad (1999), pp. 212–214.
Author information
Authors and Affiliations
Additional information
__________
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 5, pp. 666–674, May, 2006.
Rights and permissions
About this article
Cite this article
Petrenyuk, A.Y. Nonexistence of some T-factorizations of order 12. Ukr Math J 58, 751–762 (2006). https://doi.org/10.1007/s11253-006-0099-0
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11253-006-0099-0