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

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

作　　者：唐干武[1] 罗奇[1] 

机构地区：[1]桂林师范高等专科学校数学与计算机技术系,广西桂林541001

出　　处：《桂林师范高等专科学校学报》2016年第2期112-114,共3页Journal of Guilin Normal College

摘　　要：树与图的包装问题是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.

关 键 词：图 嵌入 双树森林图 包装 

分 类 号：O157.5[理学—数学]