Packing three trees

Abstract We present some results concerning edge-disjoint placement of two or three copies of a tree, as well as a theorem about the packing of three trees into the complete graph K n .

[1]  Mariusz Wozniak,et al.  Embedding Graphs of Small Size , 1994, Discret. Appl. Math..

[2]  H. Yap.  Some Topics in Graph Theory , 1986 .

[3]  David Burns,et al.  Every (p, p-2) graph is contained in its complement , 1977, J. Graph Theory.

[4]  A. Pawel Wojda,et al.  Triple placement of graphs , 1993, Graphs Comb..

[5]  Joel H. Spencer,et al.  Edge disjoint placement of graphs , 1978, J. Comb. Theory B.

[6]  Arthur M. Hobbs,et al.  Packing trees in complete graphs , 1987, Discret. Math..

[7]  Hong Wang,et al.  Packing Three Copies of a Tree into a Complete Graph , 1993, Eur. J. Comb..

[8]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[9]  Hian Poh Yap,et al.  Packing of graphs - a survey , 1988, Discret. Math..