双树森林图与同阶(p,p)图包装的研究

Packing a Forest of Double Trees Graph and(p,p)-Graph

树与图的包装问题是Erdos猜想的一部分,阶树和任意一个阶图的包装问题已解决.文章给出了双树森林图和同阶(p,p)图可包装的充分必要条件。

The packing problem of trees and graphs is a part of the Erdos conjecture,and the packing problem has been solved for n order trees and any the n order（p, p-1）-graphs. In this paper, has been proved sufficient and necessary condition for packing a forest of double trees graph and a（p, p）-graph in the same order.