On Cyclic Packing of a Tree

@article{Brandt2004OnCP,
  title={On Cyclic Packing of a Tree},
  author={Stephan Brandt and Mariusz Wozniak},
  journal={Graphs and Combinatorics},
  year={2004},
  volume={20},
  pages={435-442}
}
Abstract.We prove that there exists a packing of copies of a tree of size into Kn. Moreover, the proof provides an easy algorithm. 

Coloring, packing and embedding of graphs

TLDR
A novel holistictwig join algorithm is proposed, called TwigStack++, which features two main improvements in the decomposition and matching phase, and should be helpful for the future research on efficient query processing in a large XML database.

Bi-cyclic decompositions of complete graphs into spanning trees

References

SHOWING 1-10 OF 11 REFERENCES

Packing three trees

On the packing of three graphs

Packing Three Copies of a Tree into a Complete Graph

TLDR
All the trees T such that T is 3-placeable are characterized, and it is shown that there are three edge-disjoint copies of T in Kn.

Triple placement of graphs

TLDR
It is proved that every graph of ordern and size at mostn−2 is 3-placeable unless isomorphic either toK3 υ 2K1 or toK4 υ 4K1.

Packing of graphs - a survey

  • H. Yap
  • Mathematics
    Discret. Math.
  • 1988

Extremal Graph Theory, London: Academic

  • 1978

Packing of graphs

Edge disjoint placement of graphs

Triple placement of graphs. Graphs Comb

  • 1993