Packing $(2^{k+1}-1)$-order perfect binary trees into (\emph{k}+1)-connected graph

Jia Zhao, Jianfeng Guan, Changqiao Xu +1

Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\subset V$. If the gra…