Let Kn be a complete graph on n vertices. In this paper, we find the necessary conditions for the existence of a 6-cycle system of Kn - L for every nearly 2-regular leave L of Kn. This condition is also sufficient whe...Let Kn be a complete graph on n vertices. In this paper, we find the necessary conditions for the existence of a 6-cycle system of Kn - L for every nearly 2-regular leave L of Kn. This condition is also sufficient when the number of vertices of L is n - 4.展开更多
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.
基金Supported by the National Natural Science Foundation of China (Grant No.11071163)
文摘Let Kn be a complete graph on n vertices. In this paper, we find the necessary conditions for the existence of a 6-cycle system of Kn - L for every nearly 2-regular leave L of Kn. This condition is also sufficient when the number of vertices of L is n - 4.
基金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.
