A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On a problem of Froncek and Kubesa

2008
*
The Australasian Journal of Combinatorics
*

Let n be a positive integer and T be a tree of order 2n. We say that the complete graph K 2n of order 2n has a T -factorization if there are spanning trees T 1 , . . . , T n of K 2n , all isomorphic to T , such that each edge of K 2n belongs to exactly one of T 1 , . . . , T n . Fronček and Kubesa have raised the following question. Suppose that K 2n has a T -factorization. Is it true that T possesses a set X of n vertices such that x∈X deg T (x) = 2n − 1? In this paper, we show that the above

dblp:journals/ajc/Tan08
fatcat:fdxfkq5a6bgtjnawycrzhuf6de