Maximum Hexagon Packing of Kv-L Where L is a 2-regular Subgraph

被引:0
|
作者
Pu, Liqun [1 ]
Chai, Yanling [1 ]
Bu, Hailin [1 ]
机构
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450001, Peoples R China
关键词
6-cycle; Complete graph; Maximum packing; CYCLE DECOMPOSITIONS; SYSTEMS; LEAVES; DESIGNS; GRAPHS;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we extend the study on packing complete graph K-v with 6-cycles. Mainly, the maximum packing of K-v - L and a leave are obtained where L is a vertex-disjoint union of cycles in K-v.
引用
收藏
页码:225 / 237
页数:13
相关论文
共 50 条