All Nearly 2-Regular Leaves of Partial 6-Cycle Systems  

作　　者：Liqun PU Hengzhou XU Hao SHEN 

机构地区：[1]School of Mathematics and Statistics,Zhengzhou University [2]Department of Mathematics,Shanghai Jiao Tong University

出　　处：《Journal of Mathematical Research with Applications》2013年第6期653-665,共13页数学研究及应用（英文版）

基　　金：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.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.

关 键 词：complete graph 6-cycle nearly 2-regular. 

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