Packing three copies of a tree into its sixth power
2021
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$$
.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
0
Citations
NaN
KQI