Maximum Hexagon Packing of K_v F Where F is a Spanning Forest  

作　　者：Liqun PU Jia FANG Jun MA 

机构地区：[1]Department of Mathematics, Zhengzhou University, Henan 450001, P. R. China [2]Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, P. R. China

出　　处：《Journal of Mathematical Research with Applications》2012年第2期143-156,共14页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China (Grant No. 11071163)

摘　　要：In this paper, we extend the result of packing the complete graph Kv with 6-cycles （hexagons）. Mainly, the maximum packing of Kv - F is obtained where the leave is an odd spanning forest.In this paper, we extend the result of packing the complete graph Kv with 6-cycles （hexagons）. Mainly, the maximum packing of Kv - F is obtained where the leave is an odd spanning forest.

关 键 词：6-cycle （Hexagon） LEAVE complete graph FOREST packing. 

分 类 号：TG96[金属学及工艺—钳工工艺] S763[农业科学—森林保护学]