On factorizations of complete graphs into spanning trees with at most four nonleave vertices
Talk on the conference CSGT 2007.
The spanning trees factorization of complete graphs is a well established topic which is far from being closed. Only few classes of trees are classified whether they factorize complete graphs.
In this talk we give several necessary conditions for a spanning tree to factorize a complete graph on 2n vertices. Then we present the complete characterization of spanning trees with at most four nonleave vertices that factorize K2n.
Talk given at
Talk given on the confence CSGT 2007, 42nd Czech and Slovak Conference of graph Theory and Combinatorics, Hradec nad Moravicí, Czech Republic (14th June 2007).