Packing three copies of a tree into its sixth power
From MaRDI portal
Publication:2243090
DOI10.1007/s13226-021-00060-5zbMath1485.05151OpenAlexW3174690044MaRDI QIDQ2243090
Tarak Louleb, Hamamache Kheddouci, Fairouz Beggas, Mohamed Yahia Sayar
Publication date: 10 November 2021
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-021-00060-5
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
- The packing and covering of the complete graph. I: The forests of order five
- Packing three copies of a tree into a complete graph
- Embedding (p,p - 1) graphs in their complements
- On packing trees into complete bipartite graphs
- A note on the ``packing of two copies of some trees into their third power
- Packing of graphs - a survey
- A note on embedding graphs without short cycles
- Edge-disjoint placement of three trees
- Packing two copies of a tree into its fourth power
- Packing two copies of a tree into its third power
- Every (p,p-2) graph is contained in its complement
This page was built for publication: Packing three copies of a tree into its sixth power