Packing two copies of a tree into its third power (Q2433735): Difference between revisions

A graph \(H\) of order \(n\) is \(k\)-placeable into a graph \(G\) of order \(n\), if \(G\) contains \(k\) edge-disjoint copies of \(H\). \textit{H. Khedoucci, J.-F. Saclé} and \textit{M. Woźniak} [Discrete Math. 213, 169--178 (2000; Zbl 0956.05080)] proved that any non-star tree \(T\) is 2-placeable into \(T^4\). The present paper shows that this \(T\) is 2-placeable even into \(T^3\).