Abstract
A graph H of order n is said to be \(k-placeable\) into a graph G, having the same order n, if G contains k edge-disjoint copies of H. Kaneko et al. [9] proved that any non-star tree T is \(2-placeable\) into its third power \(T^3\). In this paper, we give a particular interest on the \(3-placement\) of a tree T into its sixth power \(T^6\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobás, B. Extremal graph theory, volume 11 of london mathematical society monographs, 1978.
Boudabbous, Y. Personal communication. 20017-2018.
Brandt, S. Embedding graphs without short cycles in their complements. Freie Univ., Fachbereich Mathematik, 1992.
Burns, D., and Schuster, S. Every (p, p-2) graph is contained in its complement. Journal of Graph Theory 1, 3 (1977), 277–279.
Burns, D., and Schuster, S. Embedding (p, p- 1) graphs in their complements. Israel Journal of Mathematics 30, 4 (1978), 313–320.
Caro, Y., and Rodity, Y. A note on packing trees into complete bipartite graphs and on fishburn’s conjecture. Discrete Mathematics 82, 3 (1990), 323–326.
Frati, F. Planar packing of diameter-four trees. In CCCG (2009), Citeseer, pp. 95–98.
Görlich, A., Pilśniak, M., Woźniak, M., and Zioło, I. A. A note on embedding graphs without short cycles. Discrete mathematics 286, 1 (2004), 75–77.
Kaneko, A., and Suzuki, K. Packing two copies of a tree into its third power. Discrete Mathematics 306, 21 (2006), 2779 – 2785.
Kheddouci, H. A note on the packing of two copies of some trees into their third power. Applied mathematics letters 16, 7 (2003), 1115–1121.
Kheddouci, H., Saclé, J.-F., and Woźniak, M. Packing two copies of a tree into its fourth power. Discrete Mathematics 213, 1-3 (2000), 169–178.
Maheo, M., Saclé, J.-F., and Woźniak, M. Edge-disjoint placement of three trees. European Journal of Combinatorics 17, 6 (1996), 543–563.
Roditty, Y. The packing and covering of the complete graph i: the forests of order five. International Journal of Mathematics and Mathematical Sciences 9, 2 (1986), 277–282.
Sauer, N., and Spencer, J. Edge disjoint placement of graphs. Journal of Combinatorial Theory, Series B 25, 3 (1978), 295–302.
Wang, H., and Sauer, N. Packing three copies of a tree into a complete graph. European journal of combinatorics 14, 2 (1993), 137–142.
Wozniak, M. Packing of graphs. Polska Akademia Nauk, Instytut Matematyczny, 1997.
Yap, H. Some topics in graph theory. london mathematics society, lecture note series 108, 1986.
Yap, H. Packing of graphs—a survey. Discrete Mathematics 72, 1 (1988), 395–404.
Yuster, R. On packing trees into complete bipartite graphs. Discrete Mathematics 163, 1-3 (1997), 325–327.
Acknowledgements
Authors gratefully thank professor Youssef Boudabbous for his constructive and important comments that he give us in ( [2]) during the development of this work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sharad S Sane, PhD.
This work is partially supported by “Informatique théorique au Maghreb” PHC-Maghreb Campus-France Project.
Rights and permissions
About this article
Cite this article
Louleb, T., Sayar, M.Y., Beggas, F. et al. Packing three copies of a tree into its sixth power. Indian J Pure Appl Math 52, 558–570 (2021). https://doi.org/10.1007/s13226-021-00060-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-021-00060-5